We study practical applications of Reynolds's defunctionalization technique, which is a whole-program transformation from higher-order to first-order functional programs. This study leads us to discover new connections between seemingly unrelated higher-order and first-order specifications and their correctness proofs. We thus perceive defunctionalization both as a springboard and as a bridge: as a springboard for discovering new connections between the first-order world and the higher-order world; and as a bridge for transferring existing results between first-order and higher-order settings
We show how the complexity of higher-order functional programs can be analysed automatically by appl...
In game semantics and related approaches to programming language semantics, programs are modelled by...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...
Defunctionalization was introduced by John Reynolds in his 1972article Definitional Interpreters for...
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...
International audienceWe show how the complexity of higher-order functional programs can be analysed...
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...
We present the first formalization of implementation strategies for first-class continuations. The f...
We describe an automated transformation which takes a higher-order program, and a produces an equiva...
The direct-style transformation aims at mapping continuation-passing programs back to direct style, ...
http://dx.doi.org/10.1007/11916277_1International audienceTermination is a major question in both lo...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
Many functional programs and higher order term rewrite systems contain, besides higher order rules, ...
We show how the complexity of higher-order functional programs can be analysed automatically by appl...
In game semantics and related approaches to programming language semantics, programs are modelled by...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...
Defunctionalization was introduced by John Reynolds in his 1972article Definitional Interpreters for...
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...
International audienceWe show how the complexity of higher-order functional programs can be analysed...
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...
We present the first formalization of implementation strategies for first-class continuations. The f...
We describe an automated transformation which takes a higher-order program, and a produces an equiva...
The direct-style transformation aims at mapping continuation-passing programs back to direct style, ...
http://dx.doi.org/10.1007/11916277_1International audienceTermination is a major question in both lo...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
Many functional programs and higher order term rewrite systems contain, besides higher order rules, ...
We show how the complexity of higher-order functional programs can be analysed automatically by appl...
In game semantics and related approaches to programming language semantics, programs are modelled by...
We build on Danvy and Nielsen's first-order program transformation into continuation-passing style (...