University of Birmingham > Talks@bham > Theoretical computer science seminar > Reconstructing the SECD machine

Reconstructing the SECD machine

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Paul Levy.

In his influential paper “Definitional interpreters for higher-order programming languages”, John Reynolds implicitly uses the program transformation known as defunctionalization to pass between higher-order and first-order programs for the same task. I shall review this transformation, showing how, combined with CPS , it can be used to derive concrete implementations of programming languages, and discuss the prospects for incorporating it in a mechanized program transformation system.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.