msp-strath / ZEUG
being the beginnings of at least zero typecheckers
☆33Updated 8 years ago
Alternatives and similar repositories for ZEUG:
Users that are interested in ZEUG are comparing it to the libraries listed below
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Updated 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
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Where my everyday research happens☆52Updated this week
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 4 months ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- ☆31Updated 10 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Implementing grep in Agda☆32Updated 4 years ago
- Formalizing nbe in agda☆30Updated 12 years ago