pigworker / Bi71Links
being a bidirectional reformulation of Martin-Löf's 1971 type theory
☆25Updated 7 years ago
Alternatives and similar repositories for Bi71
Users that are interested in Bi71 are comparing it to the libraries listed below
Sorting:
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- IO using sized types and copatterns☆35Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- Mtac in Agda☆28Updated 4 years ago
- ☆11Updated 4 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- ☆12Updated 5 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- 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 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last week
- being a thing I build on a Saturday☆28Updated 7 years ago
- Where my everyday research happens☆53Updated last week
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Logical relations proof in Agda☆26Updated 10 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago