sjoerdvisscher / unfoldable
Class of data structures that can be unfolded.
☆22Updated last year
Alternatives and similar repositories for unfoldable:
Users that are interested in unfoldable are comparing it to the libraries listed below
- First Class Record Fields in Haskell☆17Updated 2 months ago
- An implementation of Haskell’s MVars in Racket☆28Updated 6 months ago
- Interval datatype, interval arithmetic, and interval-based containers for Haskell☆21Updated 2 months ago
- Haskell bindings to Chez Scheme☆10Updated last year
- A library for benign effects in Haskell☆20Updated 3 months ago
- Generic pretty-printer for program output☆11Updated last year
- Dependent hash maps☆14Updated last month
- A usable type system for call by push-value☆33Updated 5 years ago
- A tiny statically typed programming language☆18Updated 10 years ago
- A Haskell monad transformer library for data validation☆36Updated last year
- ☆16Updated 3 years ago
- ☆17Updated last year
- Port "Software Foundations" to LiquidHaskell☆11Updated 5 years ago
- ☆14Updated last year
- An efficient graph library for Haskell☆39Updated 9 months ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- A formalization of System Fω in Agda☆17Updated 2 months ago
- Practical type inference for arbitrary-rank types☆11Updated 5 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- Austin's supercompiler work☆21Updated 5 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated last year
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 3 months ago
- ☆43Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Haskell bindings to binaryen.☆14Updated 4 years ago
- Prototype for https://github.com/Innf107/vega☆19Updated 9 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago