mgrabmueller / AlgorithmWLinks
Example implementation of Algorithm W for Hindley-Milner type inference
☆81Updated 3 years ago
Alternatives and similar repositories for AlgorithmW
Users that are interested in AlgorithmW are comparing it to the libraries listed below
Sorting:
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Build system☆123Updated last year
- An implementation of Pie in Haskell☆205Updated 5 years ago
- A language experiment -- irc.freenode.net ##coda☆163Updated last year
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆214Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 5 months ago
- The Helium compiler, Helium-as-a-library, and the texthint interpreter☆96Updated 7 months ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆83Updated 9 years ago
- Tutorial for LiquidHaskell☆78Updated 9 months ago
- 🚧 a work in progress effect system for Haskell 🚧☆129Updated last year
- Total Parser Combinators in Agda☆130Updated 2 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Generate Haskell code from a type☆136Updated 4 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- GRIN backend for GHC☆144Updated 3 years ago
- A Haskell blog☆143Updated 2 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆119Updated last month
- A small implementation of higher-order unification☆189Updated 7 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- an implementation of stuck macros☆144Updated last week
- Dependently Typed Lambda Calculus in Haskell☆115Updated 4 years ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆117Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year