| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434509 | Science of Computer Programming | 2009 | 16 Pages |
Abstract
We present the left inverse of Reynolds’ defunctionalization and we show its relevance to programming and to programming languages. We propose two methods to transform a program that is almost in defunctionalized form into one that is actually in defunctionalized form, and we illustrate them with a recognizer for Dyck words and with Dijkstra’s shunting-yard algorithm.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
