andgate / type-theory-compiler
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
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ICFP tutorial☆39Updated 3 years ago
- higher-kinded data☆30Updated last year
- A simple implementation of linear type theory☆38Updated 8 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 5 years ago
- Example row-polymorphism implementations☆61Updated last year
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 9 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated 2 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- Recursion schemes for Idris☆64Updated 6 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- Session Types with Priority in Linear Haskell☆26Updated 10 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago