A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
☆15Feb 26, 2024Updated 2 years ago
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:
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Martin-Löf type theory + W-types implemented in C (WIP)☆27Feb 16, 2026Updated 3 weeks ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- PWV Functional Language☆15Oct 30, 2023Updated 2 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Sep 29, 2022Updated 3 years ago
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- ☆14Nov 4, 2025Updated 4 months ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 3 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 2 years ago
- Matita (proof assistant) with embedded elpi☆15Jan 30, 2018Updated 8 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆64Updated this week
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Alternative implementation of the logical framework Dedukti in Rust☆23Apr 10, 2025Updated 10 months ago
- A Henkin-style completeness proof for the modal logic S5☆17Jun 20, 2021Updated 4 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Classical Logic in Haskell☆24Nov 19, 2025Updated 3 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- ⛏️ A refinement proof framework for haskell☆71May 8, 2023Updated 2 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆79Jan 20, 2022Updated 4 years ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆43Feb 25, 2026Updated last week
- A proof tree viewer that works with Coq through Proof General☆28Jan 29, 2021Updated 5 years ago
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 7 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 3 years ago
- i386 hobby kernel.☆24Oct 5, 2023Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Apr 7, 2025Updated 11 months ago
- A statically generated webring with YOCaml, because we love small-web☆24Aug 25, 2025Updated 6 months ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- A compiler for the Dana programming language☆11Apr 25, 2021Updated 4 years ago
- Mirror of ocaml-forester☆50Jun 18, 2024Updated last year
- A revival of the TREE-META compiler-compiler.☆15May 15, 2018Updated 7 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- Practical type inference for arbitrary-rank types☆11May 25, 2019Updated 6 years ago