Lambda Calculus and Functional Programming

We can define our own types in Haskell. For example, we might define a new type Assoc that provides a type for lookup tables where keys of one type are associated with values of another type in a list of (key, value) pairs: type Assoc k v = [(k, v)] Suppose we now define a function that finds the first value that is associated with a given key in a table as follows: find kt = head [v I (k',V) A A/ A/ -> V