On the occur-check free prolog programs:
Abstract: "In most Prolog implementations for the efficiency reasons so-called occur-check is omitted from the unification algorithm. We provide here natural syntactic conditions which allow the occur-check to be safely omitted. The established results apply to most well-known Prolog programs,...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1992
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,38 |
Schlagworte: | |
Zusammenfassung: | Abstract: "In most Prolog implementations for the efficiency reasons so-called occur-check is omitted from the unification algorithm. We provide here natural syntactic conditions which allow the occur-check to be safely omitted. The established results apply to most well-known Prolog programs, including those that use difference-lists, and seem to explain why this omission does not lead in practice to any complications. When applying these results to general programs we show their usefulness for proving absence of floundering. Finally, we propose a program transformation which transforms every program into a program for which only the calls to the built-in unification predicate need to be resolved by a unification algorithm with the occur-check." |
Beschreibung: | 36 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009015829 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 940206s1992 |||| 00||| eng d | ||
035 | |a (OCoLC)29452363 | ||
035 | |a (DE-599)BVBBV009015829 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
245 | 1 | 0 | |a On the occur-check free prolog programs |c Krzysztof R. Apt ; Alessandro Pellegrini |
264 | 1 | |a Amsterdam |c 1992 | |
300 | |a 36 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 92,38 | |
520 | 3 | |a Abstract: "In most Prolog implementations for the efficiency reasons so-called occur-check is omitted from the unification algorithm. We provide here natural syntactic conditions which allow the occur-check to be safely omitted. The established results apply to most well-known Prolog programs, including those that use difference-lists, and seem to explain why this omission does not lead in practice to any complications. When applying these results to general programs we show their usefulness for proving absence of floundering. Finally, we propose a program transformation which transforms every program into a program for which only the calls to the built-in unification predicate need to be resolved by a unification algorithm with the occur-check." | |
650 | 4 | |a Prolog (Computer program language) | |
700 | 1 | |a Pellegrini, Alessandro |d 1897-1985 |e Verfasser |0 (DE-588)116074892 |4 aut | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,38 |w (DE-604)BV008928356 |9 92,38 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-005961359 |
Datensatz im Suchindex
_version_ | 1804123365174149120 |
---|---|
any_adam_object | |
author | Apt, Krzysztof R. 1949- Pellegrini, Alessandro 1897-1985 |
author_GND | (DE-588)110139763 (DE-588)116074892 |
author_facet | Apt, Krzysztof R. 1949- Pellegrini, Alessandro 1897-1985 |
author_role | aut aut |
author_sort | Apt, Krzysztof R. 1949- |
author_variant | k r a kr kra a p ap |
building | Verbundindex |
bvnumber | BV009015829 |
ctrlnum | (OCoLC)29452363 (DE-599)BVBBV009015829 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01855nam a2200301 cb4500</leader><controlfield tag="001">BV009015829</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)29452363</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015829</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">Apt, Krzysztof R.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)110139763</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">On the occur-check free prolog programs</subfield><subfield code="c">Krzysztof R. Apt ; Alessandro Pellegrini</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">36 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">92,38</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In most Prolog implementations for the efficiency reasons so-called occur-check is omitted from the unification algorithm. We provide here natural syntactic conditions which allow the occur-check to be safely omitted. The established results apply to most well-known Prolog programs, including those that use difference-lists, and seem to explain why this omission does not lead in practice to any complications. When applying these results to general programs we show their usefulness for proving absence of floundering. Finally, we propose a program transformation which transforms every program into a program for which only the calls to the built-in unification predicate need to be resolved by a unification algorithm with the occur-check."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog (Computer program language)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Pellegrini, Alessandro</subfield><subfield code="d">1897-1985</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)116074892</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">92,38</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,38</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961359</subfield></datafield></record></collection> |
id | DE-604.BV009015829 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:28:36Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961359 |
oclc_num | 29452363 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 36 S. |
publishDate | 1992 |
publishDateSearch | 1992 |
publishDateSort | 1992 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
spelling | Apt, Krzysztof R. 1949- Verfasser (DE-588)110139763 aut On the occur-check free prolog programs Krzysztof R. Apt ; Alessandro Pellegrini Amsterdam 1992 36 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,38 Abstract: "In most Prolog implementations for the efficiency reasons so-called occur-check is omitted from the unification algorithm. We provide here natural syntactic conditions which allow the occur-check to be safely omitted. The established results apply to most well-known Prolog programs, including those that use difference-lists, and seem to explain why this omission does not lead in practice to any complications. When applying these results to general programs we show their usefulness for proving absence of floundering. Finally, we propose a program transformation which transforms every program into a program for which only the calls to the built-in unification predicate need to be resolved by a unification algorithm with the occur-check." Prolog (Computer program language) Pellegrini, Alessandro 1897-1985 Verfasser (DE-588)116074892 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,38 (DE-604)BV008928356 92,38 |
spellingShingle | Apt, Krzysztof R. 1949- Pellegrini, Alessandro 1897-1985 On the occur-check free prolog programs Prolog (Computer program language) |
title | On the occur-check free prolog programs |
title_auth | On the occur-check free prolog programs |
title_exact_search | On the occur-check free prolog programs |
title_full | On the occur-check free prolog programs Krzysztof R. Apt ; Alessandro Pellegrini |
title_fullStr | On the occur-check free prolog programs Krzysztof R. Apt ; Alessandro Pellegrini |
title_full_unstemmed | On the occur-check free prolog programs Krzysztof R. Apt ; Alessandro Pellegrini |
title_short | On the occur-check free prolog programs |
title_sort | on the occur check free prolog programs |
topic | Prolog (Computer program language) |
topic_facet | Prolog (Computer program language) |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT aptkrzysztofr ontheoccurcheckfreeprologprograms AT pellegrinialessandro ontheoccurcheckfreeprologprograms |