On Safe Folding

Annalisa Bossi; Nicoletta Cocco; Sandro Etalle

doi:10.1007/3-540-55844-6_135

On Safe Folding

Annalisa Bossi, Nicoletta Cocco, Sandro Etalle

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

13 Citations (Scopus)

116 Downloads (Pure)

Abstract

In [3] a general fold operation has been introduced for definite programs wrt computed answer substitution semantics. It differs from the fold operation defined by Tamaki and Sato in [26,25] because its application does not depend on the transformation history. This paper extends the results in [3] by giving a more powerful sufficient condition for the preservation of computed answer substitutions. Such a condition is meant to deal with the critical case when the atom introduced by folding depends on the clause to which the fold applies. The condition compares the dependency degree between the fonding atom and the folded clause, with the semantic delay between the folding atom and the ones to be folded. The result is also extended to a more general replacement operation, by showing that it can be decomposed into a sequence of definition, general folding and unfolding operations.

Original language	English
Title of host publication	Programming Language Implementation and Logic Programming
Subtitle of host publication	4th International Symposium, PLILP'92 Leuven, Belgium, August 26–28, 1992 Proceedings
Editors	Maurice Bruynooghe, Martin Wirsing
Place of Publication	Berlin, Heidelberg
Publisher	Springer
Pages	172-186
Number of pages	15
ISBN (Electronic)	978-3-540-47297-1
ISBN (Print)	978-3-540-55844-6
DOIs	https://doi.org/10.1007/3-540-55844-6_135
Publication status	Published - 1992
Event	4th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1992 - Leuven, Belgium Duration: 26 Aug 1992 → 28 Aug 1992 Conference number: 4

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	631
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	4th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1992
Abbreviated title	PLILP
Country/Territory	Belgium
City	Leuven
Period	26/08/92 → 28/08/92

Keywords

Program transformation
Folding
Computed answer substitution semantics

Access to Document

10.1007/3-540-55844-6_135

Bossi93safeFinal published version, 835 KB

Cite this

@inproceedings{1b80fc11947044e2b5491b4f871718ef,

title = "On Safe Folding",

abstract = "In [3] a general fold operation has been introduced for definite programs wrt computed answer substitution semantics. It differs from the fold operation defined by Tamaki and Sato in [26,25] because its application does not depend on the transformation history. This paper extends the results in [3] by giving a more powerful sufficient condition for the preservation of computed answer substitutions. Such a condition is meant to deal with the critical case when the atom introduced by folding depends on the clause to which the fold applies. The condition compares the dependency degree between the fonding atom and the folded clause, with the semantic delay between the folding atom and the ones to be folded. The result is also extended to a more general replacement operation, by showing that it can be decomposed into a sequence of definition, general folding and unfolding operations.",

keywords = "Program transformation, Folding, Computed answer substitution semantics",

author = "Annalisa Bossi and Nicoletta Cocco and Sandro Etalle",

year = "1992",

doi = "10.1007/3-540-55844-6_135",

language = "English",

isbn = "978-3-540-55844-6",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "172--186",

editor = "Maurice Bruynooghe and Martin Wirsing",

booktitle = "Programming Language Implementation and Logic Programming",

address = "Germany",

note = "4th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1992, PLILP ; Conference date: 26-08-1992 Through 28-08-1992",

}

Bossi, A, Cocco, N & Etalle, S 1992, On Safe Folding. in M Bruynooghe & M Wirsing (eds), Programming Language Implementation and Logic Programming: 4th International Symposium, PLILP'92 Leuven, Belgium, August 26–28, 1992 Proceedings. Lecture Notes in Computer Science, vol. 631, Springer, Berlin, Heidelberg, pp. 172-186, 4th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1992, Leuven, Belgium, 26/08/92. https://doi.org/10.1007/3-540-55844-6_135

On Safe Folding. / Bossi, Annalisa; Cocco, Nicoletta; Etalle, Sandro.
Programming Language Implementation and Logic Programming: 4th International Symposium, PLILP'92 Leuven, Belgium, August 26–28, 1992 Proceedings. ed. / Maurice Bruynooghe; Martin Wirsing. Berlin, Heidelberg: Springer, 1992. p. 172-186 (Lecture Notes in Computer Science; Vol. 631).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - On Safe Folding

AU - Bossi, Annalisa

AU - Cocco, Nicoletta

AU - Etalle, Sandro

N1 - Conference code: 4

PY - 1992

Y1 - 1992

N2 - In [3] a general fold operation has been introduced for definite programs wrt computed answer substitution semantics. It differs from the fold operation defined by Tamaki and Sato in [26,25] because its application does not depend on the transformation history. This paper extends the results in [3] by giving a more powerful sufficient condition for the preservation of computed answer substitutions. Such a condition is meant to deal with the critical case when the atom introduced by folding depends on the clause to which the fold applies. The condition compares the dependency degree between the fonding atom and the folded clause, with the semantic delay between the folding atom and the ones to be folded. The result is also extended to a more general replacement operation, by showing that it can be decomposed into a sequence of definition, general folding and unfolding operations.

AB - In [3] a general fold operation has been introduced for definite programs wrt computed answer substitution semantics. It differs from the fold operation defined by Tamaki and Sato in [26,25] because its application does not depend on the transformation history. This paper extends the results in [3] by giving a more powerful sufficient condition for the preservation of computed answer substitutions. Such a condition is meant to deal with the critical case when the atom introduced by folding depends on the clause to which the fold applies. The condition compares the dependency degree between the fonding atom and the folded clause, with the semantic delay between the folding atom and the ones to be folded. The result is also extended to a more general replacement operation, by showing that it can be decomposed into a sequence of definition, general folding and unfolding operations.

KW - Program transformation

KW - Folding

KW - Computed answer substitution semantics

U2 - 10.1007/3-540-55844-6_135

DO - 10.1007/3-540-55844-6_135

M3 - Conference contribution

SN - 978-3-540-55844-6

T3 - Lecture Notes in Computer Science

SP - 172

EP - 186

BT - Programming Language Implementation and Logic Programming

A2 - Bruynooghe, Maurice

A2 - Wirsing, Martin

PB - Springer

CY - Berlin, Heidelberg

T2 - 4th International Symposium on Programming Language Implementation and Logic Programming, PLILP 1992

Y2 - 26 August 1992 through 28 August 1992

ER -

On Safe Folding

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this