Open AccessRefunctionalization at Work
Author(s) -
Olivier Danvy,
Kevin Millikin
Publication year - 2008
Publication title -
brics report series
Language(s) - English
Resource type - Journals
eISSN - 1601-5355
pISSN - 0909-0878
DOI - 10.7146/brics.v15i4.21939
Subject(s) - computer science , dijkstra's algorithm , inverse , relevance (law) , programming language , work (physics) , algorithm , theoretical computer science , mathematical optimization , mathematics , engineering , shortest path problem , mechanical engineering , graph , geometry , political science , law
We present the left inverse of Reynolds's 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.