translations PCF to LC, reduction

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

You may be interested in the TYPES list: http://lists.seas.upenn.edu/mailman/listinfo/types-list -Brent On Wed, Jun 08, 2011 at 06:34:04PM +0200, ahrens wrote:
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
_______________________________________________ Beginners mailing list Beginners@haskell.org http://www.haskell.org/mailman/listinfo/beginners
participants (2)
-
ahrens
-
Brent Yorgey