andgate / type-theory-compilerLinks
Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficient LLVM IR.
☆43Updated 5 years ago
Alternatives and similar repositories for type-theory-compiler
Users that are interested in type-theory-compiler are comparing it to the libraries listed below
Sorting:
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- Example row-polymorphism implementations☆61Updated last year
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Where my everyday research happens☆53Updated last week
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- ☆30Updated 7 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago