andrejbauer / andromeda
A minimalist implementation of type theory, suitable for experimentation
☆13Updated 3 months ago
Alternatives and similar repositories for andromeda:
Users that are interested in andromeda are comparing it to the libraries listed below
- Selective applicative functors laws and theorems☆14Updated 4 years ago
- ☆29Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 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☆63Updated 10 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- ☆22Updated 8 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last month
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Generation of abstract binding trees☆27Updated 2 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- ☆29Updated 9 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Agda-style equational reasoning in Haskell☆52Updated 2 weeks ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- second-order abstract syntax☆31Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆56Updated 7 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 7 months ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆14Updated 9 years ago
- Type theory in type theory☆16Updated 12 years ago