thamugadi / call-cc-krivineLinks
A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
☆15Updated last year
Alternatives and similar repositories for call-cc-krivine
Users that are interested in call-cc-krivine are comparing it to the libraries listed below
Sorting:
- A simple λProlog interpreter☆20Updated 4 years ago
- ☆17Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- A formalization of System Fω in Agda☆20Updated 9 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 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 SKI combinators interpreter written in assembly☆20Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated 2 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
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- haha I'm graduating☆14Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated last week
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated last week
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Experimental type-checker for internally parametric type theory☆32Updated 8 months ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Linearizability Hoare Logic☆14Updated 8 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Agda to C compiler☆10Updated 2 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago