Sciweavers

LOPSTR
2007
Springer
14 years 13 days ago
Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
Elvira Albert, John P. Gallagher, Miguel Gó...
LOPSTR
2007
Springer
14 years 13 days ago
Denotation by Transformation
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Bernd Braßel, Jan Christiansen
LOPSTR
2007
Springer
14 years 13 days ago
Snapshot Generation in a Constructive Object-Oriented Modeling Language
CooML is an object-oriented modeling language where specifications are theories in a constructive logic designed to handle incomplete information. In this logic we view snapshots ...
Mauro Ferrari, Camillo Fiorentini, Alberto Momigli...
LOPSTR
2007
Springer
14 years 13 days ago
Aggregates for CHR through Program Transformation
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...
Peter Van Weert, Jon Sneyers, Bart Demoen
LOPSTR
2007
Springer
14 years 13 days ago
Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
Abstract. The goal of partial evaluation is the specialization of programs w.r.t. part of their input data. Although this technique is already well-known in the context of function...
Sebastian Fischer, Josep Silva, Salvador Tamarit, ...
LOPSTR
2007
Springer
14 years 13 days ago
A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs
Static analyses of object-oriented programs usually rely on intermediate representations that respect the original semantics while having a more uniform and basic syntax. Most of t...
Mario Méndez-Lojo, Jorge Navas, Manuel V. H...
LOPSTR
2007
Springer
14 years 13 days ago
Termination Analysis of Logic Programs Based on Dependency Graphs
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
Manh Thang Nguyen, Jürgen Giesl, Peter Schnei...
LOPSTR
2007
Springer
14 years 13 days ago
Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs
Amadeo Casas, Manuel Carro, Manuel V. Hermenegildo