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
- A very little language☆16Updated 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
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Malfunction backend for Idris with a FFI to OCaml☆28Updated 6 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- ☆17Updated last year
- Session types in Idris2!☆27Updated 5 years ago
- ☆44Updated 3 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Generation of abstract binding trees☆27Updated 2 months ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A mini-book on category theory. Superseded by https://github.com/jonsterling/forest☆53Updated 2 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 7 years ago
- A verified compiler for a lazy functional language☆37Updated 2 weeks ago
- A formalization of System Fω in Agda☆20Updated 10 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago