(home)

📎
minimalist lisp-family programming languages

About
- The anchor example for this list is 📜 Recursive Functions of Symbolic Expressions and Their Computation by Machine
📜
Recursive Functions of Symbolic Expressions and Their Computation by Machine
- author: 👤 John McCarthy
- released: 1960
- tag: lisp
- type: paper
- url: www.cs.tufts.edu/~nr/cs257/archive/john-mccarthy/recursive.pdf
- 9 primitives: lambda, label, quote, cond, car, cdr, cons, eq, atom
- Dynamically scoped
- Functions must be quoted when passed as arguments
  - Eg map '(lambda (x) (+ 1 x) ys instead of map (lambda (x) (+ 1 x) ys
    - Note that there are no integers, so the above would have to use something like Peano numbers
💾
Lispkit Lisp
- type: software
- wikipedia: en.wikipedia.org/wiki/Lispkit_Lisp
💾 Midnight Lisp
- Disclaimer: my own thing.