Sciweavers

2000 search results - page 29 / 400
» Program Transformation and Proof Transformation
Sort
View
PEPM
2004
ACM
15 years 3 months ago
Fusion with stacks and accumulating parameters
We propose a new algorithm for fusion transformation that allows both stacks and accumulating parameters. The new algorithm can fuse programs that cannot be handled by existing fu...
Susumu Nishimura
LOPSTR
1994
Springer
15 years 2 months ago
Using Call/Exit Analysis for Logic Program Transformation
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
Dmitri Boulanger, Maurice Bruynooghe
SAS
1994
Springer
15 years 2 months ago
Generating Transformers for Deforestation and Supercompilation
Abstract. Our aim is to study how the interpretive approach -- inserting an interpreter between a source program and a program specializer -- can be used to improve the transformat...
Robert Glück, Jesper Jørgensen
AGP
2003
IEEE
15 years 3 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
APCCM
2007
14 years 11 months ago
Merging Dynamic Functionality: Integration of XML Transformations
Integration of XML data is an increasingly important problem and many methods have recently been developed. In this talk, we examine the related and more challenging task of how t...
James Bailey, Ce Dong