Strongly-typed System F in Haskell
☆120Oct 18, 2022Updated 3 years ago
Alternatives and similar repositories for challenge
Users that are interested in challenge are comparing it to the libraries listed below
Sorting:
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆124Jan 12, 2025Updated last year
- Fake dependent types in Haskell using singletons☆293Feb 15, 2026Updated 2 weeks ago
- rewrite rules for type-level equalities☆62Aug 29, 2025Updated 6 months ago
- Ties the knot on data structures that reference each other by unique keys☆48Aug 2, 2024Updated last year
- Trying to write an understandable implementation of Haskell, in Haskell☆125Feb 7, 2021Updated 5 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Jan 18, 2020Updated 6 years ago
- A demo implementation of a simple dependently-typed language☆619Nov 18, 2024Updated last year
- A categorical semantics library in Agda.☆16Dec 22, 2019Updated 6 years ago
- ZuriHac 2020 GHC typechecker plugins project☆19Aug 15, 2021Updated 4 years ago
- ☆16Feb 18, 2025Updated last year
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Efficient Haskell effect handlers based on evidence translation.☆86Jul 19, 2021Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆122May 30, 2025Updated 9 months ago
- Omit fields for instance deriving☆37Jun 5, 2020Updated 5 years ago
- Efficient parser combinators for Haskell☆39Nov 25, 2025Updated 3 months ago
- A simple prolog implementation in Rust☆26Nov 14, 2020Updated 5 years ago
- Horn Clause Constraint Solving for Liquid Types☆159Updated this week
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Zippers for cofree types☆14Dec 7, 2021Updated 4 years ago
- Prettyprinting transformers for rainbow parens, precedence, etc.☆16Feb 27, 2022Updated 4 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101May 9, 2017Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Feb 5, 2020Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆56Apr 23, 2017Updated 8 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Combine and enhance Functors☆39Aug 12, 2025Updated 6 months ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Sep 23, 2025Updated 5 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Prototype implementations of systems based on setoid type theory☆66Nov 29, 2020Updated 5 years ago
- Ghosts of Departed Proofs☆63Nov 26, 2020Updated 5 years ago
- Deriving Storable instances using GHC.Generics☆16Apr 9, 2022Updated 3 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Jan 23, 2026Updated last month
- Austin's supercompiler work☆21Nov 17, 2019Updated 6 years ago
- A compiler for a simple language using llvm☆37Jun 14, 2023Updated 2 years ago