niccoloveltri / final-pfinLinks
☆12Updated 3 years ago
Alternatives and similar repositories for final-pfin
Users that are interested in final-pfin are comparing it to the libraries listed below
Sorting:
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Higher Algebra with Opetopic Types☆16Updated 2 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- ☆18Updated 3 years ago
- ☆15Updated last year
- Mtac in Agda☆28Updated 4 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- ☆14Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago
- ☆11Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last week
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago
- Quasi-quoting library for agda☆18Updated 9 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆21Updated 3 years ago
- my phd thesis☆26Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆16Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- ☆17Updated 3 years ago