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☆37Updated 7 months ago
- A Self-Interpreter for F-omega☆16Updated 9 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
- Implementation of dependent type theory in SWI-Prolog☆10Updated 5 years ago
- A dynamically-typed CBPV language embedded in Racket☆39Updated last year
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- Martin-Löf Extensible Specification and Simulator☆29Updated 10 years ago
- miniKanren with a first-order representation of the search space☆17Updated 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
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- A Dependently Typed Esolang☆10Updated 8 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 9 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 3 years ago
- αProlog☆18Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 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
- A static analysis tool for C.☆28Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 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
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 5 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- Matita (proof assistant) with embedded elpi☆14Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 3 weeks ago