sjoerdvisscher / unfoldableLinks
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
Sorting:
- A library for benign effects in Haskell☆20Updated 2 months ago
- First Class Record Fields in Haskell☆17Updated 2 months ago
- An implementation of Haskell’s MVars in Racket☆29Updated 9 months ago
- A toy dependent typed language.☆31Updated last week
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated last year
- Higher kinded polymorphism in a language with unboxed, statically sized datatypes.☆51Updated 6 months ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆36Updated this week
- ☆36Updated last year
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- APIs for more recursive definitions☆19Updated 9 months ago
- Practical type inference for arbitrary-rank types☆11Updated 6 years ago
- Anders: Cubical Type Checker☆23Updated last year
- Interval datatype, interval arithmetic, and interval-based containers for Haskell☆21Updated 2 months ago
- Fast higher-order effect handlers with evidence passing☆21Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- ☆23Updated last year
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- A simple set of io-uring bindings in Haskell☆28Updated 5 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 6 months ago
- ☆47Updated 7 years ago
- A thread-safe hash table in Haskell☆15Updated 5 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated 3 months ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated 2 weeks ago