anton-k / hindley-milner-type-checkLinks
Haskell library for type-inference with Hindley-Milner type-system.
☆34Updated 11 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
Sorting:
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆27Updated 3 months ago
- Fast equality saturation in Haskell☆84Updated 3 months ago
- ☆47Updated last week
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A core language and API for dependently typed languages☆94Updated 3 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Idris port of Haskell's sop-core library☆35Updated 2 weeks ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆122Updated 4 months ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- GRIN backend for Idris2☆34Updated 2 years ago
- Fast parsing from bytestrings☆161Updated last month
- Reimplementation of Parsley in Haskell, with improvements☆56Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Algebraic effects in the Bluefin effect system☆17Updated last year
- Learn the Agda basics in three 2-hour sessions.☆57Updated last year
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆94Updated last week
- LLVM code generation in Haskell☆54Updated 7 months ago
- ☆21Updated 3 weeks ago
- ICFP tutorial☆39Updated 3 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆31Updated last year
- Reimplementation of a subset of Cabal☆27Updated 2 months ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 4 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago