[TYPES] rewriting of typed combinator expressions

[Claus Reinke]

> Btw, you can actually come quite close to writing interpreters using 
> context-based rewrite rules in plain Haskell. Modulo the usual errors, 
> the attached code outlines the idea for normal-order and applicative-order 
> reduction in the lambda calculus.

hmm, seems that the types list strips off even simple ascii attachments?
for those who like that kind of thing and would have liked to see the 
source, it is now (temporarily) available at 

    http://www.cs.kent.ac.uk/~cr3/tmp/interp.hs

cheers,
claus