|
Haskell Chicken
A lazy chicken wanders all over town only crossing streets when it has to (1). It won't tell you where it's been (2) but you know it will always arrive at the same spot on the other side of the street (3).
(1 = lazy evaluation of function arguments)
(2 =
tracing execution and debugging
programs not as straightforward as it is in strict functional languages like ML or Scheme)
(3 =
Church-Rosser Theorem
= different orders of reduction/evaluation still give same results =
order of reduction doesn't matter = there is no more than one normal form to be reduced to, also see EOPL)
| 
programming languages with chicken