thamugadi / call-cc-krivine
A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
☆14Updated 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
- A simple λProlog interpreter☆20Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- ☆19Updated 3 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last week
- ☆15Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Agda to C compiler☆10Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A formalization of System Fω in Agda☆17Updated 2 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- ☆17Updated last year
- haha I'm graduating☆14Updated 3 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated last week
- a version of the 2048 game for Coq☆22Updated last year
- Formalising session types in Coq☆17Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A simple supercompiler formally verified in Agda☆33Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago