[Haskell-beginners] translations PCF to LC, reduction

[ahrens]

Hello,

sorry for this slightly offtopic post:

I am looking for information about translations from the programming 
language PCF to the pure lambda calculus. I am particularly interested 
in how those translations behave with respect to reduction in the source 
and target languages, such as

- does a specific translation create new redexes?
- are irreducible terms mapped to irreducibles?

I'd be grateful for any reference regarding possible translations.

Thanks,
ben