Transforming acyclic programs:
Abstract: "An Unfold/Fold transformation system is a source-to- source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. To this end, in the field of logic programmin...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1993
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,69 |
| Subjects: | |
| Summary: | Abstract: "An Unfold/Fold transformation system is a source-to- source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. To this end, in the field of logic programming, the class of acyclic programs plays an important role, as it is closely related to the one of terminating programs. The two classes coincide when negation is not allowed in the bodies of the clauses. In this paper it is proven that the Unfold/Fold transformation system defined by Tamaki and Sato preserves the acyclicity of the initial program As corollaries, it follows that when the transformation is applied to an acyclic program, then finite failure set for definite programs is preserved; in the case of normal programs, all major declarative and operational semantics are preserved as well. These results cannot be extended to the class of left terminating programs without modifying the definition of the transformation. |
| Physical Description: | 14 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010177459 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950511s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31372947 | ||
| 035 | |a (DE-599)BVBBV010177459 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Bossi, Annalisa |d 1948- |e Verfasser |0 (DE-588)122034961 |4 aut | |
| 245 | 1 | 0 | |a Transforming acyclic programs |c A. Bossi ; S. Etalle |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 14 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 93,69 | |
| 520 | 3 | |a Abstract: "An Unfold/Fold transformation system is a source-to- source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. To this end, in the field of logic programming, the class of acyclic programs plays an important role, as it is closely related to the one of terminating programs. The two classes coincide when negation is not allowed in the bodies of the clauses. In this paper it is proven that the Unfold/Fold transformation system defined by Tamaki and Sato preserves the acyclicity of the initial program | |
| 520 | 3 | |a As corollaries, it follows that when the transformation is applied to an acyclic program, then finite failure set for definite programs is preserved; in the case of normal programs, all major declarative and operational semantics are preserved as well. These results cannot be extended to the class of left terminating programs without modifying the definition of the transformation. | |
| 650 | 4 | |a Logic programming | |
| 700 | 1 | |a Etalle, Sandro |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,69 |w (DE-604)BV008928356 |9 93,69 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006759991 | ||
Record in the Search Index
| _version_ | 1804124575286427648 |
|---|---|
| any_adam_object | |
| author | Bossi, Annalisa 1948- Etalle, Sandro |
| author_GND | (DE-588)122034961 |
| author_facet | Bossi, Annalisa 1948- Etalle, Sandro |
| author_role | aut aut |
| author_sort | Bossi, Annalisa 1948- |
| author_variant | a b ab s e se |
| building | Verbundindex |
| bvnumber | BV010177459 |
| ctrlnum | (OCoLC)31372947 (DE-599)BVBBV010177459 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02031nam a2200301 cb4500</leader><controlfield tag="001">BV010177459</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950511s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31372947</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010177459</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bossi, Annalisa</subfield><subfield code="d">1948-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122034961</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Transforming acyclic programs</subfield><subfield code="c">A. Bossi ; S. Etalle</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">14 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">93,69</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "An Unfold/Fold transformation system is a source-to- source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. To this end, in the field of logic programming, the class of acyclic programs plays an important role, as it is closely related to the one of terminating programs. The two classes coincide when negation is not allowed in the bodies of the clauses. In this paper it is proven that the Unfold/Fold transformation system defined by Tamaki and Sato preserves the acyclicity of the initial program</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">As corollaries, it follows that when the transformation is applied to an acyclic program, then finite failure set for definite programs is preserved; in the case of normal programs, all major declarative and operational semantics are preserved as well. These results cannot be extended to the class of left terminating programs without modifying the definition of the transformation.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Etalle, Sandro</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">93,69</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,69</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006759991</subfield></datafield></record></collection> |
| id | DE-604.BV010177459 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:51Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006759991 |
| oclc_num | 31372947 |
| open_access_boolean | |
| physical | 14 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Bossi, Annalisa 1948- Verfasser (DE-588)122034961 aut Transforming acyclic programs A. Bossi ; S. Etalle Amsterdam 1993 14 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,69 Abstract: "An Unfold/Fold transformation system is a source-to- source rewriting methodology devised to improve the efficiency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. To this end, in the field of logic programming, the class of acyclic programs plays an important role, as it is closely related to the one of terminating programs. The two classes coincide when negation is not allowed in the bodies of the clauses. In this paper it is proven that the Unfold/Fold transformation system defined by Tamaki and Sato preserves the acyclicity of the initial program As corollaries, it follows that when the transformation is applied to an acyclic program, then finite failure set for definite programs is preserved; in the case of normal programs, all major declarative and operational semantics are preserved as well. These results cannot be extended to the class of left terminating programs without modifying the definition of the transformation. Logic programming Etalle, Sandro Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,69 (DE-604)BV008928356 93,69 |
| spellingShingle | Bossi, Annalisa 1948- Etalle, Sandro Transforming acyclic programs Logic programming |
| title | Transforming acyclic programs |
| title_auth | Transforming acyclic programs |
| title_exact_search | Transforming acyclic programs |
| title_full | Transforming acyclic programs A. Bossi ; S. Etalle |
| title_fullStr | Transforming acyclic programs A. Bossi ; S. Etalle |
| title_full_unstemmed | Transforming acyclic programs A. Bossi ; S. Etalle |
| title_short | Transforming acyclic programs |
| title_sort | transforming acyclic programs |
| topic | Logic programming |
| topic_facet | Logic programming |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT bossiannalisa transformingacyclicprograms AT etallesandro transformingacyclicprograms |