peberlein / c_lambda_calculusLinks
Lambda calculus with Church encoding in C
☆31Updated 7 years ago
Alternatives and similar repositories for c_lambda_calculus
Users that are interested in c_lambda_calculus are comparing it to the libraries listed below
Sorting:
- My Own Linear Lisp☆42Updated 7 years ago
- Library for exact real number computations☆40Updated 10 years ago
- A minimalist type-inferred programming language with procedural macro support☆136Updated 5 years ago
- A simple and educational compiler for the SASL programming language☆23Updated 7 years ago
- SKI combinators☆56Updated 8 years ago
- Joel Bartlett's fabled Scheme->C system☆83Updated 5 years ago
- Dependently-typed language with Iverson-style implicit lifting☆126Updated 5 years ago
- Generate formatted C++ from Racket S-expressions☆36Updated 10 years ago
- Guy Steele's RABBIT Scheme compiler☆62Updated 16 years ago
- APL Compiler targeting a typed array intermediate language☆217Updated last year
- [ABANDONED] An extensible shell (descended from es and rc) having functional semantics and a conventional syntax.☆51Updated 4 years ago
- Following [An Incremental Approach to Compiler Construction](http://scheme2006.cs.uchicago.edu/11-ghuloum.pdf)☆70Updated 2 months ago
- a Lispy Forth in C++☆26Updated 7 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- Function EXpression Language (interpreter for functional programs)☆84Updated 4 months ago
- Fork of Ian Piumarta's maru self-bootstrapping lisp compiler. Work has moved to http://code.google.com/r/kurts68-maru/☆41Updated 4 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆65Updated 8 months ago
- the Meta-II VM in C☆21Updated 10 years ago
- ☆87Updated 5 years ago
- A Small Combinator-Reduction System☆19Updated 5 years ago
- A small implementation of type inference☆80Updated 10 years ago
- A Pascal to LLVM compiler in Haskell☆124Updated 6 years ago
- A simple implementation of the SECD abstract machine (https://en.wikipedia.org/wiki/SECD_machine)☆126Updated 12 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆57Updated 9 years ago
- s7 Scheme☆58Updated 6 years ago
- Original Joy☆10Updated last year
- stack-based RPN functional programming language☆55Updated 8 years ago
- A C compatible and C++ like programming language that focuses on extensiblilty and giving the programmer control over how high-level cons…☆30Updated 4 years ago
- Jhc: Haskell Compiler☆39Updated 10 years ago
- Stackless Joy☆23Updated 9 months ago