Classic Algorithm W for type inference.
☆256Mar 29, 2010Updated 15 years ago
Alternatives and similar repositories for Algorithm-W-Step-By-Step
Users that are interested in Algorithm-W-Step-By-Step are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A simple, easily embeddable pure-functional language with static typing and row polymorphism.☆10Jul 9, 2015Updated 10 years ago
- A demo implementation of a simple dependently-typed language☆620Nov 18, 2024Updated last year
- Example implementation of Algorithm W for Hindley-Milner type inference☆84Jan 25, 2022Updated 4 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- Dive into GHC☆82Dec 26, 2016Updated 9 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Building a modern functional compiler from first principles. (http://dev.stephendiehl.com/fun/)☆3,516Jan 11, 2021Updated 5 years ago
- Minimal implementations for dependent type checking and elaboration☆777Jan 30, 2026Updated last month
- a Haskell implementation of Deep Learning frameworks.☆12Mar 29, 2016Updated 9 years ago
- Implementations of various type systems in OCaml.☆1,600Aug 31, 2015Updated 10 years ago
- The home of the Glamorous Glambda interpreter☆228Mar 27, 2025Updated 11 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Jul 8, 2020Updated 5 years ago
- CLI tool for Hackage☆27Sep 1, 2025Updated 6 months ago
- Haskell package for representation, parsing, and pretty-printing of GLSL☆31Sep 19, 2023Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆56Apr 23, 2017Updated 8 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- The Pie language, which accompanies The Little Typer by Friedman and Christiansen☆742Jul 7, 2021Updated 4 years ago
- A well-documented minimal dependently-typed language for my friend Lyzh☆27Feb 7, 2025Updated last year
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆27Oct 20, 2022Updated 3 years ago
- Type Checking in Lean 4☆34Mar 4, 2026Updated 3 weeks ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆378May 14, 2023Updated 2 years ago
- typing haskell in haskell☆18Sep 22, 2022Updated 3 years ago
- An implementation of Pie in Haskell☆211Nov 8, 2019Updated 6 years ago
- Implementation of Univalence in Cubical Sets☆145Jul 19, 2015Updated 10 years ago
- Unification and type inference algorithms☆127Feb 21, 2015Updated 11 years ago
- A simple ML-like programming language with subtyping and full type inference.☆189Dec 1, 2024Updated last year
- playing with hyperfunctions☆16May 2, 2021Updated 4 years ago
- A Computer Algebra System written in and for Haskell☆26Jul 10, 2016Updated 9 years ago
- An llvm pretty printer inspired by the haskell llvm binding☆31Mar 6, 2026Updated 2 weeks ago
- The Hindley Milner Type Inference Algorithm☆376Dec 11, 2016Updated 9 years ago
- ICFP tutorial☆39Jul 31, 2021Updated 4 years ago
- Haskell library: ECMAScript parser, pretty-printer and additional tools☆46Feb 8, 2024Updated 2 years ago
- mirror of A simple type-theoretic language: Mini-TT☆41Feb 15, 2017Updated 9 years ago
- haskell-like compiled language based on Python VM☆10Sep 16, 2018Updated 7 years ago
- Criterion benchmarks for the different haskell concurrent channel implementations in base and stm☆17Apr 21, 2014Updated 11 years ago
- Industrial-strength monadic parser combinator library☆965Mar 17, 2026Updated last week
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- Prune is a constraint logic programming language with branching heuristic.☆33Mar 6, 2026Updated 2 weeks ago
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago