tag:blogger.com,1999:blog-8288194986820249216.post970249291096051755..comments2024-03-22T05:09:17.789-07:00Comments on Abstract Heresies: Joe Marshallhttp://www.blogger.com/profile/03233353484280456977noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-8288194986820249216.post-9967486337524125102009-01-24T08:02:00.000-08:002009-01-24T08:02:00.000-08:00Your comments about how to compile a recursive fun...Your comments about how to compile a recursive function remind me about how one computes Pi, say, with guaranteed error bounds ("constructively"). The number of iterations of the Brent algorithm depends on the accuracy needed; to improve runtime performance intermediate results are cached (like in your cells); and precision requirements in intermediate results are propagated backwards from the final precision requirement.<BR/><BR/>Your recent posts have been very interesting, thanks.Anonymoushttps://www.blogger.com/profile/09963113574881687768noreply@blogger.comtag:blogger.com,1999:blog-8288194986820249216.post-82164210256207697972009-01-23T19:58:00.000-08:002009-01-23T19:58:00.000-08:00Well, compilation for data flow architectures was ...Well, compilation for data flow architectures was a major MIT thing for quite some time... See references like http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.8780 . IIRC, removing / transforming recursion was a major issue.Jason Riedyhttps://www.blogger.com/profile/17641550258214604241noreply@blogger.com