andrejbauer / andromeda
A minimalist implementation of type theory, suitable for experimentation
☆15Updated 6 months ago
Alternatives and similar repositories for andromeda:
Users that are interested in andromeda are comparing it to the libraries listed below
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- IO using sized types and copatterns☆33Updated 4 years ago
- ☆29Updated 9 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- System POSIX bindings for Idris.☆36Updated 6 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- ☆84Updated 7 years ago
- A talk☆28Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Haskell library of algebraic topology☆23Updated 13 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Formalization of type theory☆22Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month