While prototyping programs I find myself using association lists. This little snippet defines a lookup functions for association lists defined as lists of tuples.
68 people like thisPosted: 14 years ago by Alex Muscar
The dining philosophers problem implemented using a waiter.
5 people like thisPosted: 13 years ago by Alex Muscar
The const function is simple, but you can use it to make your code more legible. In this example we convert a unary function to a function of arity 2 (that ignores the second argument). Also by using the flip function from Haskell (which is equally easy to define) you can ignore the first argument.
119 people like thisPosted: 13 years ago by Alex Muscar