msp-strath / ZEUGLinks
being the beginnings of at least zero typecheckers
☆34Updated 8 years ago
Alternatives and similar repositories for ZEUG
Users that are interested in ZEUG are comparing it to the libraries listed below
Sorting:
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Where my everyday research happens☆53Updated last week
- Automatically exported from code.google.com/p/trellys☆47Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 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 Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- second-order abstract syntax☆31Updated 3 years ago
- The Prettiest Printer☆35Updated last year
- Observational Type Theory as an Agda library☆53Updated 8 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆45Updated 6 years ago
- Formalizing nbe in agda☆31Updated 12 years ago