domdomegg / hindley-milner-typescript-minimal
Extra minimal TypeScript implementation of Hindley-Milner type inference
☆29Updated last month
Alternatives and similar repositories for hindley-milner-typescript-minimal:
Users that are interested in hindley-milner-typescript-minimal are comparing it to the libraries listed below
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆43Updated 2 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 2 years ago
- 🎓 Web app to help teach HM type inference☆14Updated 3 weeks ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A bidirectional type checker☆63Updated 7 years ago
- Playing with type systems☆50Updated 3 months ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆39Updated 4 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- Prototype for https://github.com/Innf107/vega☆19Updated 9 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- A toy dependent typed language.☆28Updated this week
- Setoid type theory implementation☆38Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- A template for you to implement Hazelnut yourself☆21Updated 3 months ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Accompanying materials for "A Core Calculus for Documents"☆33Updated last year
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- Elaboration with inductive types☆16Updated last year
- A verified compiler for a lazy functional language☆35Updated this week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆60Updated 3 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- dependent type theory experiment☆25Updated last year
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- Anders: Cubical Type Checker☆24Updated last year