lexi-lambda / racket-mvarLinks
An implementation of Haskell’s MVars in Racket
☆29Updated 9 months ago
Alternatives and similar repositories for racket-mvar
Users that are interested in racket-mvar are comparing it to the libraries listed below
Sorting:
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- ☆17Updated last year
- Anders: Cubical Type Checker☆23Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Session types in Idris2!☆27Updated 4 years ago
- ☆43Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)☆21Updated 6 years ago
- ☆44Updated 2 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A formalization of System Fω in Agda☆17Updated 4 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- 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
- Files related to my paper "Continuity of Godel's system T functionals via effectful forcing". MFPS'2013. Electronic Notes in Theoretical …☆11Updated 3 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆30Updated 10 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Updated 2 years ago
- Class of data structures that can be unfolded.☆22Updated 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
- The Iowa Agda Library☆48Updated 3 weeks ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆17Updated 6 years ago
- A mini-book on category theory. Superseded by https://github.com/jonsterling/forest☆52Updated 2 years ago
- Formalization of type theory☆22Updated 4 years ago