andrejbauer / andromeda
A minimalist implementation of type theory, suitable for experimentation
☆15Updated 7 months ago
Alternatives and similar repositories for andromeda
Users that are interested in andromeda are comparing it to the libraries listed below
Sorting:
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- ☆29Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- ☆26Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- ☆46Updated 5 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆15Updated 9 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Observational Type Theory as an Agda library☆53Updated 7 years ago
- Deciding Presburger arithmetic in agda☆31Updated 2 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- ☆30Updated 6 years ago