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
- ☆14Updated last year
- Higher Algebra with Opetopic Types☆16Updated 2 years ago
- ☆15Updated last year
- Verified NbE via gluing in Agda☆11Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- ☆18Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆21Updated 3 years ago
- my phd thesis☆26Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- 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
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Quasi-quoting library for agda☆18Updated 8 months ago
- ☆17Updated 3 years ago
- ☆16Updated 3 years ago