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☆49Updated 4 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- Map lazy functional language constructs to LLVM IR☆52Updated 6 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- ICFP tutorial☆39Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Where my everyday research happens☆55Updated this week
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last year
- Example row-polymorphism implementations☆61Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Updated 4 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago