Sciweavers

PLILP
1992
Springer
14 years 3 months ago
Unfold/fold Transformations Preserving Termination Properties
The unfold/fold framework constitutes the spine of many program transformation strategies. However, by unrestricted use of folding the target program may terminate less often than...
Torben Amtoft
META
1992
14 years 3 months ago
Logic Meta-Programming Facilities in 'LOG
A meta-level extension of a logic programming language is presented. The resulting language, called 'LOG (read quote-log), provides meta-programming facilities similar to thos...
Iliano Cervesato, Gianfranco Rossi
META
1992
14 years 3 months ago
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs
ract Interpretation of Logic Programs Maurice Bruynooghe and Gerda :Ianssens Department of Computer Science, Katholleke Universiteit Leuven Celestijnenlaan 200A, B-3001 Heverlee, B...
Maurice Bruynooghe, Gerda Janssens
META
1992
14 years 3 months ago
Transforming Normal Programs by Replacement
The replacement transformation operation, already defined in [28], is studied wrt normal programs. We give applicability conditions able to ensure the correctness of the operation ...
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
LPAR
1992
Springer
14 years 3 months ago
From the Past to the Future: Executing Temporal Logic Programs
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
Michael Fisher, Richard Owens
LOPSTR
1992
Springer
14 years 3 months ago
Logimix: A Self-Applicable Partial Evaluator for Prolog
We present a self-applicable partial evaluator for a large subset of full Prolog. The partial evaluator, called Logimix, is the result of applying our experience from partial eval...
Torben Æ. Mogensen, Anders Bondorf
LICS
1992
IEEE
14 years 3 months ago
Equivalences on Observable Processes
The aim of this paper is to find the finest `observable' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theor...
Irek Ulidowski
LICS
1992
IEEE
14 years 3 months ago
Origins of the Calculus of Binary Relations
The calculus of binary relations was introduced by De Morgan in 1860, and was subsequently greatly developed by Peirce and Schr
Vaughan R. Pratt
LICS
1992
IEEE
14 years 3 months ago
Compiler Verification in LF
We sketch a methodology for the verification of compiler correctness based on the LF Logical Framework as realized within the Elf programming language. We have applied this techni...
John Hannan, Frank Pfenning