@article{Danvy_Nielsen_2000, title={A Higher-Order Colon Translation}, volume={7}, url={https://tidsskrift.dk/brics/article/view/20168}, DOI={10.7146/brics.v7i33.20168}, abstractNote={<p>A lambda-encoding such as the CPS transformation gives rise to administrative redexes. In his seminal article "Call-by-name, call-by-value and the lambda-calculus", 25 years ago, Plotkin tackled administrative reductions using a so-called colon translation. In "Representing control,<br />a study of the CPS transformation", 15 years later, Danvy and Filinski integrated administrative reductions in the CPS transformation, making it operate in one pass. This one-pass transformation is higher-order, and can be used for other lambda-encodings, but we do not see its associated proof technique used in practice - instead, Plotkin’s colon translation appears to be favored. Therefore, in an attempt to link the higher-order transformation and Plotkin’s proof technique, we recast Plotkin’s proof of Indifference and Simulation in a higher-order setting. To this end, we extend the colon translation from first order to higher order.</p><p>Keywords: Call by name, call by value, lambda-calculus, continuation-passing style<br />(CPS), CPS transformation, administrative reductions, colon translation, one-<br />pass CPS transformation, Indifference, Simulation.</p><p> </p>}, number={33}, journal={BRICS Report Series}, author={Danvy, Olivier and Nielsen, Lasse R.}, year={2000}, month={Jun.} }