AbstractWe 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
AbstractThis paper describes the transformation of λ-terms from continuation-passing style (CPS) to ...
Defunctionalization is generally considered a whole-program transformation and thus incompatible wit...
We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that re...
We present the left inverse of Reynolds's defunctionalization and we show its relevance to programmi...
AbstractWe present the left inverse of Reynolds’ defunctionalization and we show its relevance to pr...
We study practical applications of Reynolds's defunctionalization technique, which is a whole-progra...
Defunctionalization was introduced by John Reynolds in his 1972article Definitional Interpreters for...
We describe an automated transformation which takes a higher-order program, and a produces an equiva...
Defunctionalization is a program transformation that aims to turn a higher-order functional program ...
In the field of program transformation, one often transforms programs into continuation-passing styl...
In game semantics and related approaches to programming language semantics, programs are modelled by...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
The diagram-based method to prove correctness of program transformations consists of computing comp...
We advance in the study of the semantics of Janus, a C-like reversible programming language. Our st...
In 1972, Reynolds outlined a general method for eliminating functional arguments known as defunction...
AbstractThis paper describes the transformation of λ-terms from continuation-passing style (CPS) to ...
Defunctionalization is generally considered a whole-program transformation and thus incompatible wit...
We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that re...
We present the left inverse of Reynolds's defunctionalization and we show its relevance to programmi...
AbstractWe present the left inverse of Reynolds’ defunctionalization and we show its relevance to pr...
We study practical applications of Reynolds's defunctionalization technique, which is a whole-progra...
Defunctionalization was introduced by John Reynolds in his 1972article Definitional Interpreters for...
We describe an automated transformation which takes a higher-order program, and a produces an equiva...
Defunctionalization is a program transformation that aims to turn a higher-order functional program ...
In the field of program transformation, one often transforms programs into continuation-passing styl...
In game semantics and related approaches to programming language semantics, programs are modelled by...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
The diagram-based method to prove correctness of program transformations consists of computing comp...
We advance in the study of the semantics of Janus, a C-like reversible programming language. Our st...
In 1972, Reynolds outlined a general method for eliminating functional arguments known as defunction...
AbstractThis paper describes the transformation of λ-terms from continuation-passing style (CPS) to ...
Defunctionalization is generally considered a whole-program transformation and thus incompatible wit...
We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that re...
DOI
Add to ORKG