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:
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆18Updated 3 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- ☆15Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Mtac in Agda☆28Updated 4 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- Multimode simple type theory as an Agda library.☆23Updated 10 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- ☆14Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Quasi-quoting library for agda☆17Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated 10 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Coherence typechecker for infinity categories☆20Updated 2 months ago
- ☆11Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years 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
- Simple conversion from Agda text to literate Agda text.☆14Updated last week
- IO using sized types and copatterns☆35Updated 4 years ago