Arthur Norman’s SKI Machine was interesting: rather than being LISP (as mentioned in the talk) it was a combinator reduction machine https://en.wikipedia.org/wiki/Combinatory_logic - SK combinators are the way Miranda does lazy evaluation, so the SKI Machine was basically Miranda in hardware. Miranda was a forerunner of Haskell https://en.wikipedia.org/wiki/Miranda_(programming_language)