jfaure / lfvm-stg
Map lazy functional language constructs to LLVM IR
☆50Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for lfvm-stg
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- JHC Haskell compiler split into reusable components☆58Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- rewrite rules for type-level equalities☆62Updated 6 months ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- An efficient packed, immutable UTF8-backed Unicode text type for Haskell☆33Updated 6 years ago
- OCaml backend for Idris2☆19Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- ICFP tutorial☆40Updated 3 years ago
- Quasiquoter for LLVM☆31Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A plugin for solving numeric constraints in GHC's type-checker☆50Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆42Updated 5 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 6 months ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- A library for doing generic programming in Agda☆28Updated 3 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Work on type class deriving with elaboration reflection☆31Updated 6 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- Haskell 98 Profunctors☆70Updated 4 months ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago