PPDP
2007
Springer
13 years 10 months ago
2007
Springer
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it con...
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipul...
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
PPDP
2007
Springer
13 years 10 months ago
2007
Springer
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....