Storyyeller / polysubml-demoLinks
A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
☆66Updated 2 months ago
Alternatives and similar repositories for polysubml-demo
Users that are interested in polysubml-demo are comparing it to the libraries listed below
Sorting:
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆48Updated last year
- A pure type system implemented in OCaml☆78Updated 5 years ago
- Fir programming language☆90Updated last week
- Full Source Code for Making a Language series☆63Updated this week
- Match compilation algorithm in OCaml☆34Updated 10 months ago
- Pure functional programming with whole-program mutability inference☆79Updated last month
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- Accompanying materials for "A Core Calculus for Documents"☆36Updated 2 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
- A collection of programming languages and type systems.☆33Updated 8 months ago
- A toy dependent typed language.☆36Updated last week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆144Updated 6 years ago
- Playing with type systems☆51Updated last year
- ☆42Updated 5 months ago
- Ordo: A minimalist language with row polymorphism☆85Updated 9 months ago
- A deterministic parser with fused lexing☆75Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Staged compilation with dependent types☆187Updated 8 months ago
- A bidirectional type checker☆67Updated 8 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆64Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆77Updated 3 years ago
- 🦖 Implementations of various type inference algorithms. The new project is now at https://github.com/cu1ch3n/type-inference-zoo-frontend…☆153Updated 6 months ago
- The Next Generation of Compositional Programming☆56Updated 3 weeks ago
- ☆16Updated 3 years ago
- Duo - A research language exploring duality in programming language design☆61Updated 2 years ago
- Apple array system☆69Updated 2 weeks ago
- source code for the bondi programming language☆44Updated 6 years ago