jfecher / algorithm-j
A minimal implementation of Hindley-Milner's Algorithm J in OCaml
☆48Updated 2 years ago
Related projects: ⓘ
- Playing with type systems☆43Updated 2 years ago
- A ML-like pure functional language that can be used as a template for creating your own language☆26Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- A dependent type theory with user defined data types☆46Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆79Updated 4 years ago
- A toy language based on LLVM that implements the System Fω type-system☆102Updated last year
- A pure type system implemented in OCaml☆78Updated 3 years ago
- A pretty-printing combinator library for OCaml☆47Updated last month
- an implementation of Observational Type Theory (OTT) and more☆25Updated last year
- Fωμ type checker and compiler☆51Updated last year
- A fancy diagnostics library that allows your compilers to exit with grace☆72Updated 3 months ago
- A WIP little dependently-typed systems language☆37Updated last month
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆54Updated last year
- 🪆 A Staged Type Theory☆35Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- 🦠 Reusable components based on algebraic effects☆47Updated 2 months ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆43Updated last year
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆28Updated 2 months ago
- ♾️ A library for universe levels and universe polymorphism☆32Updated 3 months ago
- 🩺 A library for compiler diagnostics☆34Updated 6 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆52Updated 4 months ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆79Updated 3 years ago
- a functional programming language with algebraic effects and handlers☆81Updated 2 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆23Updated 2 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆91Updated 2 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆86Updated 5 years ago
- The Caml Light implementation of the Caml language☆59Updated last year
- A dependently typed programming language with direct style effects and linearity☆18Updated last month