I'm genuinely curious while skimming Jay’s book, I couldn’t help but notice parallels with LISP-based approaches, which are also tree-structured. How does this

I'm genuinely curious while skimming Jay’s book, I couldn’t help but notice parallels with LISP-based approaches, which are also tree-structured. How does this differ from those? Additionally, I have another question: where is this theory [potentially] applied, even if only in niche areas? Finally, I think there is a glitch in [1] where define "false = t, true = t, etc" I think they meant false = f ? I was mesmerized by a tree representation of not though. [1] https://treecalcul.us/specification/ https://treecalcul.us/specification/