pigworker / Bi71
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
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆11Updated 4 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Mtac in Agda☆28Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- being a thing I build on a Saturday☆28Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 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
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆18Updated 2 years ago
- ☆28Updated 2 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆48Updated last month
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago