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-hosting lambda calculus compiler☆36Updated 4 months ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 2 months ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 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 simple λProlog interpreter☆20Updated 3 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
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- Collaborative work on reversible computing☆25Updated 3 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- miniKanren with a first-order representation of the search space☆17Updated last year
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- αProlog☆18Updated 2 years ago
- A static analysis tool for C.☆27Updated 5 years ago
- Implementation of dependent type theory in SWI-Prolog☆9Updated 4 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- Interactive Theorem Proving for students☆20Updated last year
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 12 years ago
- Logic for story telling!☆34Updated 7 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆20Updated 10 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 5 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year