lexi-lambda / racket-mvarLinks
An implementation of Haskell’s MVars in Racket
☆30Updated last year
Alternatives and similar repositories for racket-mvar
Users that are interested in racket-mvar are comparing it to the libraries listed below
Sorting:
- ☆45Updated 2 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- ☆37Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated 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
- A very little language☆16Updated 2 years ago
- ☆44Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- The Iowa Agda Library☆49Updated last month
- Awesome Agda Programming☆18Updated last month
- 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
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Session types in Idris2!☆27Updated 4 years ago
- The Alms Programming Language☆44Updated 7 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆17Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- ☆23Updated 2 years ago
- xmonad in Coq☆46Updated 13 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 8 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year