2000 search results - page 41 / 400 » Program Transformation and Proof Transformation |
LOPSTR
2007
Springer
15 years 4 months ago
2007
Springer
We propose an extension of Constraint Handling Rules (CHR) with aggregates such as sum, count, findall, and min. This new feature significantly improves the conciseness and expres...
SCAM
2008
IEEE
15 years 4 months ago
2008
IEEE
An appropriate translation of the data model is central to any language migration effort. Finding a mapping between original and target data models may be challenging for legacy l...
SC
1995
ACM
15 years 1 months ago
1995
ACM
This paper presents techniques for compiling loops with complex, indirect array accesses into loops whose array references have at most one level of indirection. The transformatio...
ENTCS
2008
14 years 8 months ago
2008
In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...