andrejbauer / andromeda
A minimalist implementation of type theory, suitable for experimentation
☆13Updated last month
Related projects ⓘ
Alternatives and complementary repositories for andromeda
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- System F in coq.☆19Updated 9 years ago
- ☆29Updated 9 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- System POSIX bindings for Idris.☆36Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆22Updated 4 years ago
- The Alms Programming Language☆44Updated 6 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- ☆28Updated 6 years ago
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 11 months ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- Type provider library for Idris☆92Updated 6 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆42Updated 5 years ago
- The Prettiest Printer☆35Updated 9 months ago
- ☆82Updated 7 years ago
- Session types in Idris2!☆27Updated 3 years ago
- being an experiment with potato power☆23Updated 4 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- ☆26Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago