Strongly-typed System F in Haskell
☆121Oct 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- ZuriHac 2020 GHC typechecker plugins project☆19Aug 15, 2021Updated 4 years ago
- Fake dependent types in Haskell using singletons☆294May 20, 2026Updated 3 weeks ago
- rewrite rules for type-level equalities☆62Aug 29, 2025Updated 9 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆124May 6, 2026Updated last month
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Trying to write an understandable implementation of Haskell, in Haskell☆126Feb 7, 2021Updated 5 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Jan 18, 2020Updated 6 years ago
- Ties the knot on data structures that reference each other by unique keys☆48Aug 2, 2024Updated last year
- A demo implementation of a simple dependently-typed language☆624Nov 18, 2024Updated last year
- Symbol manipulation☆37Apr 17, 2023Updated 3 years ago
- ☆109Jun 1, 2026Updated last week
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 7 years ago
- Automatic type class law checking.☆24May 2, 2026Updated last month
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Demo for high-performance type theory elaboration☆591Feb 2, 2026Updated 4 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆73Feb 5, 2020Updated 6 years ago
- Label dependent dependent session types☆16May 2, 2024Updated 2 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101May 9, 2017Updated 9 years ago
- QuickCheck extension for higher-order properties☆19Feb 14, 2022Updated 4 years ago
- An implementation of Pie in Haskell☆213Nov 8, 2019Updated 6 years ago
- Zippers for cofree types☆14Dec 7, 2021Updated 4 years ago
- ICFP 2020 papers. Crowd-sourced☆90Jul 27, 2020Updated 5 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆153Sep 23, 2025Updated 8 months ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆129Jan 23, 2026Updated 4 months ago
- ☆37Jun 20, 2021Updated 4 years ago
- Horn Clause Constraint Solving for Liquid Types☆161Updated this week
- Combine and enhance Functors☆39Aug 12, 2025Updated 10 months ago
- A very little language☆16Jul 1, 2023Updated 2 years ago
- reverse dependency build matrix generator☆33Sep 19, 2020Updated 5 years ago
- DEPRECATED use autodocodec instead An optparse-applicative -style explainable yaml parser.☆28Oct 20, 2021Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated 2 years ago
- Deploy open-source AI quickly and easily - Special Bonus Offer • AdRunpod Hub is built for open source. One-click deployment and autoscaling endpoints without provisioning your own infrastructure.
- A categorical semantics library in Agda.☆16Dec 22, 2019Updated 6 years ago
- Efficient Haskell effect handlers based on evidence translation.☆86Jul 19, 2021Updated 4 years ago
- Efficient parser combinators for Haskell☆39Nov 25, 2025Updated 6 months ago
- ☆16Feb 18, 2025Updated last year
- Benchmarks for capture-avoiding substitution☆123May 30, 2025Updated last year
- Ghosts of Departed Proofs☆64Nov 26, 2020Updated 5 years ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,061Jun 13, 2025Updated last year