ngzhian / skiLinks
SKI combinators
☆55Updated 8 years ago
Alternatives and similar repositories for ski
Users that are interested in ski are comparing it to the libraries listed below
Sorting:
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆60Updated 5 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆81Updated 8 years ago
- a self-hosting lambda calculus compiler☆37Updated 7 months ago
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- A collection of programming languages and type systems.☆33Updated 6 months ago
- source code for the bondi programming language☆42Updated 6 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- CMSC 430 Design and Implementation of Programming Languages☆52Updated 2 weeks ago
- A correct Scheme interpreter derived from the R5RS spec's formal semantics, written in Haskell.☆21Updated 6 months ago
- Hope programming language interpreter☆42Updated 5 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- Sinister's Scheme Compiler!☆24Updated 3 years ago
- A Pascal to LLVM compiler in Haskell☆124Updated 6 years ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆77Updated 5 years ago
- Kempe is a compiled stack-based language☆58Updated last year
- Course on Metaprogramming☆72Updated 4 months ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- The Twelf Programming Language☆143Updated this week
- A nano "theorem prover".☆62Updated 6 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 5 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆55Updated 5 years ago
- A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines☆38Updated 5 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆45Updated 7 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆36Updated 2 months ago
- A simple Prolog interpreter☆42Updated 3 years ago
- Yet another Scheme implemented in Haskell☆20Updated 5 years ago
- ☆44Updated 3 years ago