http://www.kennknowles.com/blog/2008/05/10/debugging-with-open-recursion-mixins/ Mathematics, Haskell, and little bit of Linux Mon, 12 May 2008 21:35:32 +0000 http://wordpress.org/?v=2.8 hourly 1 http://www.kennknowles.com/blog/2008/05/10/debugging-with-open-recursion-mixins/comment-page-1/#comment-38 Kenn Mon, 12 May 2008 21:35:32 +0000 http://www.kennknowles.com/blog/2008/05/10/debugging-with-open-recursion-mixins/#comment-38 <p>Thanks for the great links, ccshan. I enjoyed both papers very much. I found especially interesting how all three developments, when you include the paper I linked, make subtly different choices about the division of functionality between combinators.</p> Thanks for the great links, ccshan. I enjoyed both papers very much. I found especially interesting how all three developments, when you include the paper I linked, make subtly different choices about the division of functionality between combinators.

]]> http://www.kennknowles.com/blog/2008/05/10/debugging-with-open-recursion-mixins/comment-page-1/#comment-36 ccshan Mon, 12 May 2008 20:44:07 +0000 http://www.kennknowles.com/blog/2008/05/10/debugging-with-open-recursion-mixins/#comment-36 <p>You'd probably enjoy McAdam's <a href="http://www.lfcs.inf.ed.ac.uk/reports/97/ECS-LFCS-97-375/" rel="nofollow">"That About Wraps it Up"</a> and Swadi, Taha, Kiselyov, and Pašalić's <a href="http://www.cs.rice.edu/~taha/publications/conference/pepm06.pdf" rel="nofollow">"A Monadic Approach for Avoiding Code Duplication When Staging Memoized Functions"</a>. The latter authors cite DeMeuter and McAdam.</p> You’d probably enjoy McAdam’s “That About Wraps it Up” and Swadi, Taha, Kiselyov, and Pašali&#x107;’s “A Monadic Approach for Avoiding Code Duplication When Staging Memoized Functions”. The latter authors cite DeMeuter and McAdam.

]]>