Recursion is for suckers

Or, how to implement letrecs in a λ-calculus-based language (such as CoreML, a subset of ML) with ordinary, nonrecursive functions.

This post is probably only going to be of interest if you’re interested in programming languages, or perhaps were someone who once struggled to implement letrecs in a CoreML interpreter in a certain grad-level class at Purdue a year ago. (Hi, Jeff!)

But hey, I can rationalize this post by claiming it’s part of my studying for Tuesday’s Programming Languages midterm. Yeah, that’s it.

Read the rest of this entry »

Quote of the Week #30

Imagine if every Thursday your shoes exploded if you tied them the usual way. This happens to us all the time with computers, and nobody thinks of complaining.

– Jef Raskin

Comments Off