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
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 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
- being a thing I build on a Saturday☆28Updated 7 years ago
- ☆11Updated 4 years ago
- Mtac in Agda☆28Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months 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 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 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 library for doing generic programming in Agda☆31Updated 4 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- what I did on my holidays☆12Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago