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
Landin's J operator was the first control operator for functional languages. It was specified with a...
The diagram-based method to prove correctness of program transformations consists of computing comp...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...
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...
We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that re...
We study the relationship between small-step semantics, big-step semantics and abstract machines, fo...
We advance in the study of the semantics of Janus, a C-like reversible programming language. Our st...
Refactoring tools allow the programmer to pretend they are working with a richer language where the ...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
Landin's J operator was the first control operator for functional languages. It was specified with a...
The diagram-based method to prove correctness of program transformations consists of computing comp...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...
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...
We bridge two distinct approaches to one-pass CPS transformations, i.e., CPS transformations that re...
We study the relationship between small-step semantics, big-step semantics and abstract machines, fo...
We advance in the study of the semantics of Janus, a C-like reversible programming language. Our st...
Refactoring tools allow the programmer to pretend they are working with a richer language where the ...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
Landin's J operator was the first control operator for functional languages. It was specified with a...
The diagram-based method to prove correctness of program transformations consists of computing comp...
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules...