Lazy List Comprehension in Logic Programming.
Saved in:
| Title: | Lazy List Comprehension in Logic Programming. |
|---|---|
| Authors: | ELBL, BIRGIT1 birgit@informatik.unibw-muenchen.de |
| Source: | Journal of Logic & Computation. Oct2002, Vol. 12 Issue 5, p747-771. 25p. |
| Subjects: | Programming languages, Horn clauses, Finite differences, Semantics, Comprehension, Axioms |
| Abstract: | The pure prolog evaluation of a goal yields a list of answers, but the tools provided for manipulating these structures are very poor. We discuss augmenting pure prolog with a list comprehension construct that offers the possibility of referring to the finite or infinite list of answers produced. Thus meta-predicates can be defined. A substructural calculus is used to give an axiomatic semantics to the extended language. Soundness and completeness of the intended evaluation with respect to this semantics is proved. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
