jpt4 / skioLinks
Pure relational SKI combinator calculus interpreter.
☆11Updated 8 years ago
Alternatives and similar repositories for skio
Users that are interested in skio are comparing it to the libraries listed below
Sorting:
- A Self-Interpreter for F-omega☆16Updated 10 years ago
- a self-hosting lambda calculus compiler☆37Updated 9 months ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 7 months ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A small NuPRL style proof assistant☆31Updated 6 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 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 4 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆24Updated 9 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Collaborative work on reversible computing☆25Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- Dealing with Flags and Options☆13Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13Updated 9 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆57Updated 5 years ago
- Prove formulas of Presburger Arithmetic☆11Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- ☆17Updated 7 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago