The replacement operation for CCP programs

Marco Bertolino, Sandro Etalle, Catuscia Palamidessi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The replacement is a very powerful transformation operation which - both within the functional paradigm as well as within the logic programming one - can mimic the most common transformation operations such as unfold, fold, switching, distribution. Because of this flexibility, it can be incorrect if used without specific applicability conditions. In this paper we present applicability conditions which ensure the correctness of the replacement operation in the context of Concurrent Constraint Programs. Furthermore we show that, under these conditions, the replacement generalizes both the unfolding operation as well as a restricted form of folding operation.

Original languageEnglish
Title of host publicationLogic-Based Program Synthesis and Transformation - 9th International Workshop, LOPSTR 1999, Selected Papers
EditorsAnnalisa Bossi
PublisherSpringer Verlag
Pages216-233
Number of pages18
ISBN (Print)3540676287, 9783540676287
DOIs
Publication statusPublished - 1 Jan 2000
Externally publishedYes
Event9th International Workshop on Logic-Based Program Synthesis and Transformation, LOPSTR 1999 - Venice, Italy
Duration: 22 Sept 199924 Sept 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1817
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Workshop on Logic-Based Program Synthesis and Transformation, LOPSTR 1999
Country/TerritoryItaly
CityVenice
Period22/09/9924/09/99

Fingerprint

Dive into the research topics of 'The replacement operation for CCP programs'. Together they form a unique fingerprint.

Cite this