Ekdohibs / joujou
A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a static type system with inference of types and effects, with subtyping.
☆89Updated 6 years ago
Alternatives and similar repositories for joujou:
Users that are interested in joujou are comparing it to the libraries listed below
- Example row-polymorphism implementations☆61Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- An interpreter of F-ing modules☆19Updated 5 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Hindley-Milner type inference using constraints☆50Updated 8 years ago
- The language of the future!☆72Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 3 weeks ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- A toy language based on LLVM that implements the System Fω type-system☆108Updated last year
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Strict Haskell-like programming language that compiles to LLVM☆70Updated 5 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Updated 7 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆98Updated 2 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 2 years ago