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
. The paper shows how term rewriting techniques can be used to automatically transform first-order f...
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve ...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
AbstractWe present the left inverse of Reynolds’ defunctionalization and we show its relevance to pr...
We present the left inverse of Reynolds's defunctionalization and we show its relevance to programmi...
Defunctionalization is a program transformation that aims to turn a higher-order functional program ...
We describe an automated transformation which takes a higher-order program, and a produces an equiva...
We study practical applications of Reynolds's defunctionalization technique, which is a whole-progra...
Refactoring tools allow the programmer to pretend they are working with a richer language where the ...
Defunctionalization was introduced by John Reynolds in his 1972article Definitional Interpreters for...
In 1972, Reynolds outlined a general method for eliminating functional arguments known as defunction...
Abst ract. An Unfold/Fold transformation system is a source-to-source rewrit-ing methodology devised...
We propose an unfold-fold transformation system which preserves left termination for definite progra...
Abstract: In previous work we showed how to verify a compiler for a small language with exceptions. ...
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve ...
. The paper shows how term rewriting techniques can be used to automatically transform first-order f...
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve ...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
AbstractWe present the left inverse of Reynolds’ defunctionalization and we show its relevance to pr...
We present the left inverse of Reynolds's defunctionalization and we show its relevance to programmi...
Defunctionalization is a program transformation that aims to turn a higher-order functional program ...
We describe an automated transformation which takes a higher-order program, and a produces an equiva...
We study practical applications of Reynolds's defunctionalization technique, which is a whole-progra...
Refactoring tools allow the programmer to pretend they are working with a richer language where the ...
Defunctionalization was introduced by John Reynolds in his 1972article Definitional Interpreters for...
In 1972, Reynolds outlined a general method for eliminating functional arguments known as defunction...
Abst ract. An Unfold/Fold transformation system is a source-to-source rewrit-ing methodology devised...
We propose an unfold-fold transformation system which preserves left termination for definite progra...
Abstract: In previous work we showed how to verify a compiler for a small language with exceptions. ...
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve ...
. The paper shows how term rewriting techniques can be used to automatically transform first-order f...
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve ...
Context: Reynolds showed us how to use continuation-passing style and defunctionalization to transfo...
DOI
Add to ORKG