Pure relational SKI combinator calculus interpreter.
☆11Jul 13, 2017Updated 8 years ago
Alternatives and similar repositories for skio
Users that are interested in skio are comparing it to the libraries listed below
Sorting:
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Sep 29, 2022Updated 3 years ago
- A Small Combinator-Reduction System☆18Jul 14, 2020Updated 5 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- A revival of the TREE-META compiler-compiler.☆15May 15, 2018Updated 7 years ago
- Automatically exported from code.google.com/p/intuitionistic☆31Apr 8, 2015Updated 10 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- concise functionless functional esolang☆14Jan 18, 2026Updated last month
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Classical Logic in Haskell☆24Nov 19, 2025Updated 3 months ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- MStoical - a Forth like language, but better☆24Mar 23, 2024Updated last year
- The fractal land generator☆15Aug 3, 2019Updated 6 years ago
- Doom - reimplemented cleanly, in C++, without all the obscuring optimizations☆12Jan 9, 2015Updated 11 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13May 21, 2016Updated 9 years ago
- ☆12May 9, 2015Updated 10 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- A collection of freely-licensed js1k entries☆10Feb 29, 2016Updated 10 years ago
- A compiler for the Dana programming language☆11Apr 25, 2021Updated 4 years ago
- Cellular automata environment written in Common Lisp☆17Apr 17, 2021Updated 4 years ago
- Prove formulas of Presburger Arithmetic☆11Oct 5, 2024Updated last year
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Feb 11, 2026Updated 3 weeks ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Feb 28, 2019Updated 7 years ago
- TinyForth Standard -- microscopic simplified forth standard of 35 words, designed to make forth as simple, extensible, and readable as po…☆13Feb 26, 2023Updated 3 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Machine-checked Agda formalization for the ILC project☆15Apr 6, 2018Updated 7 years ago
- PWV Functional Language☆15Oct 30, 2023Updated 2 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago