Loop checking in partial deduction:
Abstract: "In the framework of [LS], partial deduction involves the creation of SLD-trees for a given program and some goals, up to certain halting points. This paper identifies the relation between halting criteria for partial deduction and loop checking (as formalized in [BAK]). It appears th...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,34 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In the framework of [LS], partial deduction involves the creation of SLD-trees for a given program and some goals, up to certain halting points. This paper identifies the relation between halting criteria for partial deduction and loop checking (as formalized in [BAK]). It appears that loop checks for partial deduction must be complete, whereas traditionally the soundness of a loop check is more important. However, it is also shown that sound loop checks can contribute to improve partial decuction. Finally, a class of complete loop checks suitable for partial deduction is identified." |
| Beschreibung: | 34 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008992674 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25511930 | ||
| 035 | |a (DE-599)BVBBV008992674 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Bol, Roland N. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Loop checking in partial deduction |c R. N. Bol |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 34 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 91,34 | |
| 520 | 3 | |a Abstract: "In the framework of [LS], partial deduction involves the creation of SLD-trees for a given program and some goals, up to certain halting points. This paper identifies the relation between halting criteria for partial deduction and loop checking (as formalized in [BAK]). It appears that loop checks for partial deduction must be complete, whereas traditionally the soundness of a loop check is more important. However, it is also shown that sound loop checks can contribute to improve partial decuction. Finally, a class of complete loop checks suitable for partial deduction is identified." | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Loops (Group theory) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,34 |w (DE-604)BV008928356 |9 91,34 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941596 | ||
Datensatz im Suchindex
| _version_ | 1804123335125106688 |
|---|---|
| any_adam_object | |
| author | Bol, Roland N. |
| author_facet | Bol, Roland N. |
| author_role | aut |
| author_sort | Bol, Roland N. |
| author_variant | r n b rn rnb |
| building | Verbundindex |
| bvnumber | BV008992674 |
| ctrlnum | (OCoLC)25511930 (DE-599)BVBBV008992674 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01571nam a2200301 cb4500</leader><controlfield tag="001">BV008992674</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25511930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008992674</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="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bol, Roland N.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Loop checking in partial deduction</subfield><subfield code="c">R. N. Bol</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">34 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">91,34</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In the framework of [LS], partial deduction involves the creation of SLD-trees for a given program and some goals, up to certain halting points. This paper identifies the relation between halting criteria for partial deduction and loop checking (as formalized in [BAK]). It appears that loop checks for partial deduction must be complete, whereas traditionally the soundness of a loop check is more important. However, it is also shown that sound loop checks can contribute to improve partial decuction. Finally, a class of complete loop checks suitable for partial deduction is identified."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Loops (Group theory)</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">91,34</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,34</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941596</subfield></datafield></record></collection> |
| id | DE-604.BV008992674 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941596 |
| oclc_num | 25511930 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 34 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Bol, Roland N. Verfasser aut Loop checking in partial deduction R. N. Bol Amsterdam 1991 34 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,34 Abstract: "In the framework of [LS], partial deduction involves the creation of SLD-trees for a given program and some goals, up to certain halting points. This paper identifies the relation between halting criteria for partial deduction and loop checking (as formalized in [BAK]). It appears that loop checks for partial deduction must be complete, whereas traditionally the soundness of a loop check is more important. However, it is also shown that sound loop checks can contribute to improve partial decuction. Finally, a class of complete loop checks suitable for partial deduction is identified." Logic programming Loops (Group theory) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,34 (DE-604)BV008928356 91,34 |
| spellingShingle | Bol, Roland N. Loop checking in partial deduction Logic programming Loops (Group theory) |
| title | Loop checking in partial deduction |
| title_auth | Loop checking in partial deduction |
| title_exact_search | Loop checking in partial deduction |
| title_full | Loop checking in partial deduction R. N. Bol |
| title_fullStr | Loop checking in partial deduction R. N. Bol |
| title_full_unstemmed | Loop checking in partial deduction R. N. Bol |
| title_short | Loop checking in partial deduction |
| title_sort | loop checking in partial deduction |
| topic | Logic programming Loops (Group theory) |
| topic_facet | Logic programming Loops (Group theory) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT bolrolandn loopcheckinginpartialdeduction |