andrejbauer / andromeda
A minimalist implementation of type theory, suitable for experimentation
☆12Updated 4 years ago
Related projects: ⓘ
- IO using sized types and copatterns☆33Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Examples of relevant technologies for implementing DSLs in Haskell.☆14Updated 8 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- The Prettiest Printer☆35Updated 7 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- ☆82Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago
- System POSIX bindings for Idris.☆35Updated 5 years ago
- Efficient union and equivalence testing of sets.☆29Updated 5 years ago
- ☆28Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆68Updated 2 years ago
- Semantics for Cryptol☆16Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A hip inductive theorem prover!☆87Updated 2 years ago
- The Evolution of a Typechecker☆51Updated 5 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆28Updated 3 years ago
- Collects examples used to produce the paper 'Session Types with Linearity in Haskell' by Orchard and Yoshida (2017).☆12Updated 9 months ago
- Haskell library of algebraic topology☆23Updated 12 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated last year
- A simple implementation of linear type theory☆38Updated 7 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- Embedded C code generation DSL for Haskell.☆28Updated 5 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago