imneme / mini-skLinks
A Small Combinator-Reduction System
☆15Updated 5 years ago
Alternatives and similar repositories for mini-sk
Users that are interested in mini-sk are comparing it to the libraries listed below
Sorting:
- Pure relational SKI combinator calculus interpreter.☆11Updated 8 years ago
- A simple and educational compiler for the SASL programming language☆23Updated 7 years ago
- A revival of the TREE-META compiler-compiler.☆15Updated 7 years ago
- Manfred von Thun's Programming Language Joy☆16Updated 8 months ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- For exploring http://www.ioccc.org/2012/tromp/hint.html☆35Updated 8 years ago
- Portable high-level assembler with authentic C syntax☆25Updated 3 years ago
- lang Thue + Regex☆15Updated 3 years ago
- MIRROR of https://codeberg.org/catseye/Tamsin : Somewhere between a meta-language, a programming language, and a rubbish lister☆18Updated last year
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13Updated 9 years ago
- Original Joy☆10Updated 9 months ago
- Automatically exported from code.google.com/p/intuitionistic☆31Updated 10 years ago
- An interpreter for concatenative combinators (i.e. Combinators as a functional language)☆10Updated 3 years ago
- Stackless Joy☆23Updated 5 months ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆59Updated 3 months ago
- Val Schorre's META-II☆61Updated 12 years ago
- A Self-Interpreter for F-omega☆16Updated 9 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago
- Prove formulas of Presburger Arithmetic☆11Updated 11 months ago
- an APL-style array calculator/interpreter in C based on the J-incunabulum, extended to allow propagating specifications a+2+a<3, more fun…☆29Updated 8 years ago
- ☆21Updated 12 years ago
- SECD microprocessor reimplementation in VHDL☆35Updated 5 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆33Updated last year
- Bologna Optimal Higher-Order Machine, Version 1.1☆77Updated 8 years ago
- Following [An Incremental Approach to Compiler Construction](http://scheme2006.cs.uchicago.edu/11-ghuloum.pdf)☆68Updated 3 weeks ago
- αProlog☆18Updated 2 years ago
- A tiny CPU☆20Updated 16 years ago
- MIRROR of https://codeberg.org/catseye/Vinegar : A semi-concatenative language where every operation can fail☆15Updated last year