uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Prolog with arrays and bounded quantifications
Uppsala University.
Uppsala University.
1996 (English)In: JOURNAL OF PROGRAMMING LANGUAGES, ISSN 0963-9306, Vol. 4, no 3, 117-141 p.Article in journal (Other scientific) Published
Abstract [en]

It is proposed to add bounded quantifications to Prolog. The main reason is one of natural expression; many algorithms are expressed more elegantly in a declarative way using bounded quantifications than using existing means, i.e. recursion. In particular

Place, publisher, year, edition, pages
CHAPMAN HALL LTD , 1996. Vol. 4, no 3, 117-141 p.
Keyword [en]
logic programming; arrays; quantification; definite iteration; abstract machines; PROGRAMS
URN: urn:nbn:se:uu:diva-27220OAI: oai:DiVA.org:uu-27220DiVA: diva2:55114
Addresses: Barklund J, UNIV UPPSALA, DEPT COMP SCI, BOX 311, S-75105 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-15

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

Total: 179 hits
ReferencesLink to record
Permanent link

Direct link