cu1ch3n / type-inference-zooLinks
🦖 Implementations of various type inference algorithms. The new project is now at https://github.com/cu1ch3n/type-inference-zoo-frontend.
☆151Updated 4 months ago
Alternatives and similar repositories for type-inference-zoo
Users that are interested in type-inference-zoo are comparing it to the libraries listed below
Sorting:
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated 2 weeks ago
- A language with dependent data and codata types☆124Updated this week
- The MLscript programming language. Functional and object-oriented; structurally typed and sound; with powerful type inference. Soon to ha…☆209Updated this week
- A menagerie of cute implementations of modern typechecking algorithms☆340Updated last week
- Pure functional programming with whole-program mutability inference☆78Updated 3 months ago
- Alternative algorithm for algebraic subtyping.☆170Updated last month
- Learn Lean 4 with PLFA proofs.☆94Updated 7 months ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Wasm SpecTec specification tools☆79Updated this week
- Staged compilation with dependent types☆183Updated 6 months ago
- ☆39Updated 3 months ago
- Fir programming language☆80Updated last week
- a proof-of-concept programming language based on call-by-push-value☆57Updated this week
- being an operating system for typechecking processes☆130Updated last month
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆45Updated 8 months ago
- Programming Language Foundations in Lean☆43Updated 3 months ago
- An experimental language exploring computation and meaning through term unification, with logic-agnostic types.☆116Updated this week
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆225Updated last year
- Dependent type checker using normalisation by evaluation☆269Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- An example on how to write an incremental, concurrent, fault-tolerant compiler☆60Updated 4 months ago
- Accompanying materials for "A Core Calculus for Documents"☆35Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- The Next Generation of Compositional Programming☆54Updated 2 months ago
- A proof checker meant for education. Primarily for teaching proofs of correctness of functional programs.☆117Updated this week
- Datalog with equality for rust☆71Updated 2 weeks ago
- A toy dependent typed language.☆32Updated last week
- ☆119Updated last year
- 🌐 | HTTP primitives for Lean 4☆49Updated last year
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆75Updated 3 years ago