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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- A Small Combinator-Reduction System☆18Jul 14, 2020Updated 5 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Sep 29, 2022Updated 3 years ago
- Automatically exported from code.google.com/p/intuitionistic☆31Apr 8, 2015Updated 10 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Classical Logic in Haskell☆24Nov 19, 2025Updated 4 months ago
- concise functionless functional esolang☆14Jan 18, 2026Updated 2 months ago
- new generation language☆20Aug 2, 2013Updated 12 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
- Type inference for ML-like languages. A port to F# of "Algorithm W Step by Step" by Martin Grabmüller.☆11Sep 17, 2014Updated 11 years ago
- A revival of the TREE-META compiler-compiler.☆15Mar 10, 2026Updated 2 weeks ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Apr 18, 2018Updated 7 years ago
- A compiler for the Dana programming language☆11Apr 25, 2021Updated 4 years ago
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13May 21, 2016Updated 9 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 6 months ago
- ☆12May 9, 2015Updated 10 years ago
- A library for non-deterministically parsing natural language expressions into a structured form.☆18Feb 3, 2023Updated 3 years ago
- Erlang BEAM emulator in Haskell☆48Jun 14, 2014Updated 11 years ago
- MStoical - a Forth like language, but better☆24Mar 23, 2024Updated 2 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21May 13, 2025Updated 10 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- Genetic program repair using GHC☆33May 16, 2024Updated last year
- Charity Programming Language☆41Apr 14, 2015Updated 10 years ago
- pattern combinators extending racket/match to capture 🔗 contexts 📦☆20Jul 8, 2019Updated 6 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- My stumpwm config☆10Jun 27, 2019Updated 6 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- Unification and type inference algorithms☆127Feb 21, 2015Updated 11 years ago
- An equational theorem prover based on Knuth-Bendix completion☆62Mar 12, 2026Updated last week
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Jun 12, 2019Updated 6 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago