domdomegg / hindley-milner-typescript-minimal
Extra minimal TypeScript implementation of Hindley-Milner type inference
☆28Updated 5 months ago
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
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆36Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 9 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 3 years ago
- Demo for dependent types + runtime code generation☆66Updated this week
- A bidirectional type checker☆59Updated 7 years ago
- A WIP little dependently-typed systems language☆41Updated 6 months ago
- Refinement types + dependent types = ❤️☆58Updated 2 years ago
- 🎓 Web app to help teach HM type inference☆14Updated 2 weeks ago
- Fωμ type checker and compiler☆52Updated 2 years ago
- Playing with type systems☆48Updated last month
- A toy dependent typed language.☆28Updated this week
- 🪆 A Staged Type Theory☆34Updated last year
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Accompanying materials for "A Core Calculus for Documents"☆31Updated last year
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆60Updated 3 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- an implementation of Observational Type Theory (OTT) and more☆26Updated 2 years ago
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆23Updated 2 years ago
- ☆30Updated 4 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆26Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated this week
- Setoid type theory implementation☆38Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A Language with Dependent Data and Codata Types☆80Updated this week