thamugadi / call-cc-krivine
A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
☆14Updated 11 months 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
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Agda to C compiler☆10Updated last year
- A simple λProlog interpreter☆20Updated 3 years ago
- A Henkin-style completeness proof for the modal logic S5☆13Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- ☆16Updated 10 months ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- ☆13Updated 6 months ago
- being an implementation of the calculus of constructions☆15Updated last year
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- haha I'm graduating☆13Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated last year
- 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
- ☆17Updated 3 years ago
- Organize mathematical thoughts☆19Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Verified NbE via gluing in Agda☆11Updated 9 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A SKI combinators interpreter written in assembly☆17Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Experiments with Realizability in Univalent Type Theory☆17Updated 4 months 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
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 5 months ago
- IO for Gallina☆32Updated 2 months ago