andgate / type-theory-compilerLinks
Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficient LLVM IR.
☆44Updated 6 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☆48Updated 4 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Map lazy functional language constructs to LLVM IR☆50Updated 6 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Where my everyday research happens☆55Updated 3 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆81Updated 12 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- ICFP tutorial☆39Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 9 months ago
- System F in coq.☆19Updated 10 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Implementing grep in Agda☆33Updated 4 years ago