david-christiansen / epigram1
A version of Epigram 1 that can run with newer GHCs
☆52Updated 7 years ago
Alternatives and similar repositories for epigram1:
Users that are interested in epigram1 are comparing it to the libraries listed below
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- Mtac in Agda☆28Updated 3 years ago
- The multimode presheaf proof-assistant☆36Updated last year
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- ☆22Updated 8 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 11 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 2 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆21Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Web based opetopic editor☆35Updated 3 months ago