Skip to content

Comment on Lisp Koans by Googleparent

Comments

The optimization of tail-call optimization is converting some recursive procedure descriptions into iterative processes. A recursive procedure description may instead describe a necessarily recursive process. The difference between descriptions and the procedures they produce is one of the issues covered in SICP - most explicitly by Ableson in one of the videos.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.