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:
- Bologna Optimal Higher-Order Machine, Version 1.1☆73Updated 8 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆58Updated last month
- a self-hosting lambda calculus compiler☆36Updated 3 months ago
- Hope programming language interpreter☆41Updated last month
- A collection of programming languages and type systems.☆33Updated 2 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 4 years ago
- SPSC: A Small Positive Supercompiler☆37Updated last year
- source code for the bondi programming language☆40Updated 6 years ago
- Abstract krivine machine implementing call-by-name semantics. In OCaml.☆43Updated 7 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆122Updated 3 years ago
- The Twelf Programming Language☆137Updated 5 months ago
- This repository contains coding examples of all sorts written in ATS and possibly other programming languages. These examples are primari…☆61Updated 4 years ago
- CMSC 430 Design and Implementation of Programming Languages☆51Updated 7 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- A compiler for the gradually typed lambda calculus☆75Updated 3 years ago
- A self-hosting mini Haskell compiler with a mini C runtime.☆75Updated 5 years ago
- Course on Metaprogramming☆71Updated 2 weeks ago
- Examples from the class CMSC 330 during Summer 2015☆48Updated 9 years ago
- A Pascal to LLVM compiler in Haskell☆125Updated 5 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 7 years ago
- Kempe is a compiled stack-based language☆58Updated 9 months ago
- Untyped Concatenative Calculus☆19Updated 3 years ago
- MicroC example compiler for Stephen Edward's PLT class, but in Haskell☆117Updated 4 years ago
- A custom parser/auto-formatter for Standard ML☆78Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- A simple Prolog interpreter☆42Updated 3 years ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- ☆90Updated 3 years ago