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 3 years ago
- 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
- ☆17Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A formalization of System Fω in Agda☆19Updated 8 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 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
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- haha I'm graduating☆14Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 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☆26Updated 5 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Agda to C compiler☆10Updated 3 weeks ago
- Linearizability Hoare Logic☆14Updated 7 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- ☆17Updated 7 years ago