Sciweavers

674 search results - page 36 / 135
» Explanation Based Program Transformation
Sort
View
AGP
1997
IEEE
15 years 1 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
ENTCS
2008
91views more  ENTCS 2008»
14 years 9 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
FPCA
1995
15 years 1 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
81
Voted
JLP
2010
142views more  JLP 2010»
14 years 4 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
ADBIS
2004
Springer
111views Database» more  ADBIS 2004»
15 years 3 months ago
A High-Level Language for Specifying XML Data Transformations
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
Tadeusz Pankowski