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
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆17Updated last year
- A formalization of System Fω in Agda☆19Updated 7 months ago
- being an implementation of the calculus of constructions☆17Updated 2 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
- 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 Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated last month
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Linearizability Hoare Logic☆14Updated 6 months ago
- haha I'm graduating☆14Updated 4 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- being a particular fragment of Haskell, extended to a proof system☆38Updated last month
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated this week
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- ☆17Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago