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:
- An implementation of Haskell’s MVars in Racket☆28Updated 7 months ago
- First Class Record Fields in Haskell☆17Updated last week
- Anders: Cubical Type Checker☆24Updated last year
- A library for benign effects in Haskell☆20Updated last week
- A usable type system for call by push-value☆33Updated 5 years ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆20Updated 6 years ago
- A tiny statically typed programming language☆18Updated 10 years ago
- Dependent hash maps☆14Updated last month
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 11 months ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- A Haskell monad transformer library for data validation☆36Updated last year
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Generic pretty-printer for program output☆11Updated last year
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- Interval datatype, interval arithmetic, and interval-based containers for Haskell☆21Updated 3 weeks ago
- An efficient graph library for Haskell☆39Updated this week
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Semi-naïve typed Datalog backend with runtime, transformations, and foreign predicate support☆16Updated 4 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- ☆17Updated last year
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆18Updated 8 years ago
- Derivation of Optimized Definitions Based on Specs☆15Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated 10 months ago