Google Answers: version of letrec that builds each closure at most once.

View Question

Q: version of letrec that builds each closure at most once. ( No Answer, 0 Comments )

Question

Subject: version of letrec that builds each closure at most once.
Category: Computers > Programming
Asked by: johnkaplan-ga
List Price: $10.00

Posted: 22 Mar 2006 19:22 PST
Expires: 30 Mar 2006 20:00 PST
Question ID: 710831

Solution of 3.35 of Essentials of Programming Languages.
How do implement a version of letrec that builds each closure at most
once? If closure is never retrieved, it should never be built.

Answer

There is no answer at this time.

Comments

There are no comments at this time.

Important Disclaimer: Answers and comments provided on Google Answers are general information, and are not intended to substitute for informed professional medical, psychiatric, psychological, tax, legal, investment, accounting, or other professional advice. Google does not endorse, and expressly disclaims liability for any product, manufacturer, distributor, service or service provider mentioned or any opinion expressed in answers or comments. Please read carefully the Google Answers Terms of Service.

If you feel that you have found inappropriate content, please let us know by emailing us at answers-support@google.com with the question ID listed above. Thank you.

Search Google Answers for

Google Home - Answers FAQ - Terms of Service - Privacy Policy