10.1145/1111542.1111563Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation121-12
AbstractThis paper shows how the Improvement Theorem — a semantic condition for establishing the tot...
We present a formal derivation of program schemes that are usually called Backtracking programs and ...
We present an approach to inductive synthesis of functional programs based on the detection of recur...
AbstractWe study transformations and equivalences of recursive program schemes. We give an optimizat...
. We revisit the main techniques of program transformation which are used in partial evaluation, mix...
A well-established approach to reasoning about loops during program analysis is to capture the effec...
We present optimization techniques for high level equational programs that are generalizations of af...
Peer-reviewed. received 16th March 1999; accepted 8th September 1999The transformation of a recursi...
Algorithms which are recursive have running times which can be described by recurrence equations or ...
A systematic transformational approach is given for deriving incremental programs from non-incremen...
International Symposium on Parallel Symbolic Computation, Proceedings, PASCO101-11027
Turchin's supercompilation is a program transformation technique for functional languages. A su...
This Final Report of research conducted under the support of NSF grant MCS75 13875 A01 summarizes re...
AbstractProgram transformation is the mechanical manipulation of a program in order to improve it re...
The program transformation methodology can provide valuable techniques and tools for the development...
AbstractThis paper shows how the Improvement Theorem — a semantic condition for establishing the tot...
We present a formal derivation of program schemes that are usually called Backtracking programs and ...
We present an approach to inductive synthesis of functional programs based on the detection of recur...
AbstractWe study transformations and equivalences of recursive program schemes. We give an optimizat...
. We revisit the main techniques of program transformation which are used in partial evaluation, mix...
A well-established approach to reasoning about loops during program analysis is to capture the effec...
We present optimization techniques for high level equational programs that are generalizations of af...
Peer-reviewed. received 16th March 1999; accepted 8th September 1999The transformation of a recursi...
Algorithms which are recursive have running times which can be described by recurrence equations or ...
A systematic transformational approach is given for deriving incremental programs from non-incremen...
International Symposium on Parallel Symbolic Computation, Proceedings, PASCO101-11027
Turchin's supercompilation is a program transformation technique for functional languages. A su...
This Final Report of research conducted under the support of NSF grant MCS75 13875 A01 summarizes re...
AbstractProgram transformation is the mechanical manipulation of a program in order to improve it re...
The program transformation methodology can provide valuable techniques and tools for the development...
AbstractThis paper shows how the Improvement Theorem — a semantic condition for establishing the tot...
We present a formal derivation of program schemes that are usually called Backtracking programs and ...
We present an approach to inductive synthesis of functional programs based on the detection of recur...
DOI
Add to ORKG