Storyyeller / polysubml-demoLinks
A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
☆61Updated this week
Alternatives and similar repositories for polysubml-demo
Users that are interested in polysubml-demo are comparing it to the libraries listed below
Sorting:
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆45Updated 10 months ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Fir programming language☆80Updated last week
- Match compilation algorithm in OCaml☆30Updated 7 months ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- A toy dependent typed language.☆32Updated last week
- A bidirectional type checker☆64Updated 8 years ago
- Accompanying materials for "A Core Calculus for Documents"☆34Updated 2 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Pure functional programming with whole-program mutability inference☆77Updated 2 months ago
- Playing with type systems☆51Updated 9 months ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Prototype for https://github.com/Innf107/vega☆19Updated last year
- A deterministic parser with fused lexing☆74Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- Alternative algorithm for algebraic subtyping.☆170Updated 3 weeks ago
- The Next Generation of Compositional Programming☆54Updated last month
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A collection of programming languages and type systems.☆33Updated 5 months ago
- ☆37Updated last year
- A verified compiler for a lazy functional language☆37Updated last week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- Staged compilation with dependent types☆183Updated 5 months ago
- Kempe is a compiled stack-based language☆58Updated last year
- Build system☆128Updated 2 years ago
- Ordo: A minimalist language with row polymorphism☆85Updated 6 months ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆74Updated 3 years ago