mgrabmueller / AlgorithmWLinks
Example implementation of Algorithm W for Hindley-Milner type inference
☆81Updated 4 years ago
Alternatives and similar repositories for AlgorithmW
Users that are interested in AlgorithmW are comparing it to the libraries listed below
Sorting:
- Strongly-typed System F in Haskell☆120Updated 3 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Updated 5 years ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- The Helium compiler, Helium-as-a-library, and the texthint interpreter☆98Updated last year
- Build system☆134Updated 3 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated last year
- Generate Haskell code from a type☆146Updated 11 months ago
- The Disco Discus Compiler☆176Updated 7 years ago
- GRIN backend for GHC☆142Updated 4 years ago
- A language experiment -- irc.freenode.net ##coda☆163Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆215Updated 2 years ago
- Tutorial for LiquidHaskell☆81Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- A Haskell blog☆151Updated 3 months ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Dependently Typed Lambda Calculus in Haskell☆116Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- an implementation of stuck macros☆152Updated last month
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- Horn Clause Constraint Solving for Liquid Types☆157Updated last week
- Fast parsing from bytestrings☆173Updated 3 months ago
- Unification and type inference algorithms☆127Updated 10 years ago
- JHC Haskell compiler split into reusable components☆57Updated 7 years ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- Another implementation of Frank.☆70Updated 8 years ago
- Total Parser Combinators in Agda☆133Updated 6 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year