Notes concerning “Lisp”

• Enumerating binary trees and their elements 2007 to 2009 (4 minutes)
• Eur-Scheme: a simplified Ur-Scheme 2007 to 2009 (13 minutes)
• Designing a Scheme for APL-like array computations, like Lush 2007 to 2009 (4 minutes)
• Quasiquote patterns 2007 to 2009 (9 minutes)
• bytecode interpreters for tiny computers 2007-09 (61 minutes)
• Linear trees 2016-05-19 (updated 2016-05-20) (6 minutes)
• Lisp 1.5 in a stack bytecode: can we get from machine code to Lisp in 45 lines of code? 2018-04-27 (4 minutes)
• Patterns for failure-free, bounded-space, and bounded-time programming 2018-04-27 (updated 2019-09-10) (42 minutes)
• A homoiconic language with a finite-map-based data model rather than lists? 2019-09-25 (updated 2019-09-28) (46 minutes)