anton-k / hindley-milner-type-check
Haskell library for type-inference with Hindley-Milner type-system.
☆34Updated 9 months ago
Alternatives and similar repositories for hindley-milner-type-check:
Users that are interested in hindley-milner-type-check are comparing it to the libraries listed below
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- ☆47Updated 3 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- LLVM code generation in Haskell☆55Updated 4 months ago
- Fast equality saturation in Haskell☆83Updated last month
- Algebraic effects in the Bluefin effect system☆15Updated 10 months ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆91Updated 7 months ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- A core language and API for dependently typed languages☆90Updated last month
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated last month
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆113Updated last month
- ICFP tutorial☆39Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Staged push/pull fusion with typed Template Haskell☆57Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Named parameters (keyword arguments) for Haskell☆94Updated this week
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated 2 weeks ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year