Storyyeller / polysubml-demoLinks
A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
☆54Updated 5 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:
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆40Updated 7 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- A toy dependent typed language.☆31Updated this week
- Playing with type systems☆51Updated 7 months ago
- Match compilation algorithm in OCaml☆28Updated 5 months ago
- Pure functional programming with whole-program mutability inference☆72Updated last week
- ☆36Updated last year
- Fωμ type checker and compiler☆54Updated 2 years ago
- Ordo: A minimalist language with row polymorphism☆82Updated 3 months ago
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- A deterministic parser with fused lexing☆73Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- A dependently-typed, array-polymorphic language that runs on parallel architectures☆24Updated 10 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- ☆16Updated 3 years ago
- Apple array system☆67Updated last month
- 🦖 Implementations of various type inference algorithms. Online interactive playground is available at https://zoo.cuichen.cc/☆145Updated last month
- The Next Generation of Compositional Programming☆52Updated last month
- Full Source Code for Making a Language series☆50Updated last month
- Bologna Optimal Higher-Order Machine, Version 1.1☆74Updated 8 years ago
- A template for you to implement Hazelnut yourself☆22Updated 2 weeks ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 10 months ago
- Prototype for https://github.com/Innf107/vega☆19Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 2 months ago
- Fir programming language☆63Updated this week