thamugadi / call-cc-krivine
A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
☆14Updated 8 months ago
Related projects ⓘ
Alternatives and complementary repositories for call-cc-krivine
- A simple λProlog interpreter☆20Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- A SKI combinators interpreter written in assembly☆17Updated 4 years ago
- haha I'm graduating☆13Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A Henkin-style completeness proof for the modal logic S5☆13Updated 3 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
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- Experiments with Realizability in Univalent Type Theory☆17Updated last month
- being an implementation of the calculus of constructions☆15Updated last year
- Higher kinded polymorphism in SML☆15Updated 4 years ago
- ☆14Updated 8 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆25Updated this week
- ☆13Updated this week
- Agda to C compiler☆10Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- A type theory with native support for Polynomial Functors.☆38Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- ☆16Updated 7 months ago
- Verified NbE via gluing in Agda☆11Updated 6 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago