anton-k / hindley-milner-type-checkLinks
Haskell library for type-inference with Hindley-Milner type-system.
☆34Updated last year
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:
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- LLVM code generation in Haskell☆54Updated 7 months ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 5 months ago
- ☆47Updated 3 weeks ago
- Reimplementation of Parsley in Haskell, with improvements☆56Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆29Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Fast equality saturation in Haskell☆84Updated 4 months ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- Example of using Yampa and GHC Wasm backend to create a simple web app.☆18Updated last year
- ICFP tutorial☆39Updated 3 years ago
- Painless 2D vector graphics, animations, and simulations powered by GLFW (Fork of gloss)☆39Updated last month
- Algebraic effects in the Bluefin effect system☆18Updated last year
- Eventually a practical 2-level TT-based compiler☆27Updated 3 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆23Updated 3 weeks ago
- Fast parsing from bytestrings☆161Updated this week
- Learn the Agda basics in three 2-hour sessions.☆59Updated last year
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆94Updated 3 weeks ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- Reimplementation of a subset of Cabal☆30Updated this week