A few questions:
1. Do you provide any kind of largest common subtree caching for cheaper input?
2. Have you tried auto-generating Lisp programs structurally?
3. Have you tried augmenting a Lisp language with a `choice` function that makes choices given a prompt, the environment, and the continuation stack?
(1) Nope, it's always the same input token cost
(2-3) No, but that's kind of a sick cook ... Want to get access and try it? [email protected]