thamugadi / call-cc-krivineLinks
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
Sorting:
- A simple λProlog interpreter☆20Updated 3 years ago
- A SKI combinators interpreter written in assembly☆19Updated 4 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- ☆15Updated last year
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆17Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated 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
- ☆19Updated 3 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Agda to C compiler☆10Updated last year
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last month
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 weeks ago
- A formalization of System Fω in Agda☆17Updated 3 months 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
- 🪆 A Staged Type Theory☆35Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- IO for Gallina☆33Updated 3 months ago
- Organize mathematical thoughts☆20Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆38Updated 2 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- haha I'm graduating☆14Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago