Arrays, bounded quantification and iteration in logic and constraint logic programming:
Abstract: "We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explici...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Amsterdam
1995
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
95,43 |
Schlagworte: | |
Zusammenfassung: | Abstract: "We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification." |
Beschreibung: | 15 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV011063511 | ||
003 | DE-604 | ||
005 | 20030116 | ||
007 | t | ||
008 | 961115s1995 |||| 00||| engod | ||
035 | |a (OCoLC)34292287 | ||
035 | |a (DE-599)BVBBV011063511 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
100 | 1 | |a Apt, Krzysztof R. |d 1949- |e Verfasser |0 (DE-588)110139763 |4 aut | |
245 | 1 | 0 | |a Arrays, bounded quantification and iteration in logic and constraint logic programming |c K. R. Apt |
264 | 1 | |a Amsterdam |c 1995 | |
300 | |a 15 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 95,43 | |
520 | 3 | |a Abstract: "We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification." | |
650 | 4 | |a Logic programming | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 95,43 |w (DE-604)BV008928356 |9 95,43 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007409604 |
Datensatz im Suchindex
_version_ | 1804125552331718656 |
---|---|
any_adam_object | |
author | Apt, Krzysztof R. 1949- |
author_GND | (DE-588)110139763 |
author_facet | Apt, Krzysztof R. 1949- |
author_role | aut |
author_sort | Apt, Krzysztof R. 1949- |
author_variant | k r a kr kra |
building | Verbundindex |
bvnumber | BV011063511 |
ctrlnum | (OCoLC)34292287 (DE-599)BVBBV011063511 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01622nam a2200277 cb4500</leader><controlfield tag="001">BV011063511</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961115s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34292287</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011063511</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">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">Arrays, bounded quantification and iteration in logic and constraint logic programming</subfield><subfield code="c">K. R. Apt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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">95,43</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</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">95,43</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">95,43</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007409604</subfield></datafield></record></collection> |
id | DE-604.BV011063511 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T18:03:22Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007409604 |
oclc_num | 34292287 |
open_access_boolean | |
physical | 15 S. |
publishDate | 1995 |
publishDateSearch | 1995 |
publishDateSort | 1995 |
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 Arrays, bounded quantification and iteration in logic and constraint logic programming K. R. Apt Amsterdam 1995 15 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 95,43 Abstract: "We claim that programming within the logic programming paradigm suffers from lack of attention given to iteration and arrays. To convince the reader about their merits we present several examples of logic and constraint logic programs which use iteration and arrays instead of explicit recursion and lists. These programs are substantially simpler than their counterparts written in the conventional way. They are easier to write and to understand, are guaranteed to terminate and their declarative character makes it simpler to argue about their correctness. Iteration is implemented by means of bounded quantification." Logic programming Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 95,43 (DE-604)BV008928356 95,43 |
spellingShingle | Apt, Krzysztof R. 1949- Arrays, bounded quantification and iteration in logic and constraint logic programming Logic programming |
title | Arrays, bounded quantification and iteration in logic and constraint logic programming |
title_auth | Arrays, bounded quantification and iteration in logic and constraint logic programming |
title_exact_search | Arrays, bounded quantification and iteration in logic and constraint logic programming |
title_full | Arrays, bounded quantification and iteration in logic and constraint logic programming K. R. Apt |
title_fullStr | Arrays, bounded quantification and iteration in logic and constraint logic programming K. R. Apt |
title_full_unstemmed | Arrays, bounded quantification and iteration in logic and constraint logic programming K. R. Apt |
title_short | Arrays, bounded quantification and iteration in logic and constraint logic programming |
title_sort | arrays bounded quantification and iteration in logic and constraint logic programming |
topic | Logic programming |
topic_facet | Logic programming |
volume_link | (DE-604)BV008928356 |
work_keys_str_mv | AT aptkrzysztofr arraysboundedquantificationanditerationinlogicandconstraintlogicprogramming |