(Enter summary)
Abstract: In this paper we study unfold/fold transformations for constraint logic programs (CLP) with
dynamic scheduling and for concurrent constraint programming (ccp). We define suitable applicability
conditions for this transformations which ensure us that the original and the transformed program
have the same results of successful computations and have the same deadlocked derivations.
The possible applications of these results are twofold. On one hand we can use the unfold/fold
system to optimize CLP ... (Update)
Context of citations to this paper: More
.... coroutining program which is not nicely moded for which the above lemma does not apply (see for instance the program reader writer in [16]) Corollary 4.4 Let the program P and the query Q : A; B be nicely moded. Suppose that : A; B 7 C 1 ; C 2 is a partial input...
.... the transformation system with respect to the chosen semantics, which is a problem that readily leverages the results of Etalle et al. [5, 4, 6]. 2.2 Verification In the framework depicted above, there are two aspects that require the development and use of verification tools....
Cited by: More
The Narrowing-Driven Approach to Functional Logic Program.. - Albert, Vidal (2002)
(Correct)
A Partial Evaluation Framework for Curry Programs - Albert, Alpuente, Hanus, Vidal (1999)
(Correct)
LicenseScript - A Language and Framework for.. - Chong, Law, Etalle.. (2002)
(Correct)
Active bibliography (related documents): More All
0.0: Program Derivation = Rules + Strategies - Pettorossi, Proietti (2001)
(Correct)
0.0: Transformation of Logic Programs - Pettorossi, Proietti (1998)
(Correct)
0.0: Transformations of CLP Modules - Etalle, Gabbrielli (1995)
(Correct)
Similar documents based on text: More All
0.4: Unfold/Fold Transformations of CCP programs - Sandro Etalle (1998)
(Correct)
0.4: Transformations of CCP programs - Etalle, Gabbrielli (2001)
(Correct)
0.3: Proving Concurrent Constraint Programs Correct - de Boer, al. (1997)
(Correct)
Related documents from co-citation: More All
5: The Oz programming model
- Smolka - 1995
3: Specialization of lazy functional logic programs
- Alpuente, Falaschi et al. - 1997
3: The Integration of Functions into Logic Programming: From Theory to Practice (context) - Hanus - 1994
BibTeX entry: (Update)
Systems. Etalle, S., Gabbrielli, M., and Marchiori, E. 1997. A Transformation System for CLP with Dynamic Scheduling and CCP. In ACM--SIGPLAN Symposium on Partial Evaluation and Semantic Based Program Manipulation (1997). ACM Press. http://citeseer.ist.psu.edu/etalle97transformation.html More
@inproceedings{ etalle97transformation,
author = "Sandro Etalle and Maurizio Gabbrielli and Elena Marchiori",
title = "A Transformation System for {CLP} with Dynamic Scheduling and {CCP}",
booktitle = "Partial Evaluation and Semantic-Based Program Manipulation",
pages = "137-150",
year = "1997",
url = "citeseer.ist.psu.edu/etalle97transformation.html" }
Citations (may not include all citations):
385
A transformation system for developing recursive programs
- Burstall, Darlington - 1977
23
Verification of logic programs with delay declarations
- Apt, Luitjes - 1995
23
Transforming Constraint Logic Programs (context) - Bensaou, Guessarian - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.unimaas.nl/~etalle/papers/index.htm): More
Simultaneous Replacement in Normal Programs - Bossi, Cocco, Etalle (1993)
(Correct)
Layered Modes - Etalle, Gabbrielli (1996)
(Correct)
Well-Terminating Programs - Etalle, Bossi, Cocco (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC