sjoerdvisscher / unfoldableLinks
Class of data structures that can be unfolded.
☆22Updated 2 years ago
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☆30Updated last year
- Demo code for the talk Dependent Types in Haskell in Hong Kong Functional Programming meetup☆16Updated 6 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- First Class Record Fields in Haskell☆17Updated 4 months ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- ☆23Updated 2 years ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated last year
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- Visualization of Haskell data structures☆16Updated last year
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- A well typed by construction kernel language for bidirectional programming☆13Updated 9 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- A library for benign effects in Haskell☆20Updated 5 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- JVM implementation in Haskell☆44Updated last year
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- ☆14Updated 2 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 10 months ago
- ☆21Updated last week