Continuations for parallel logic programming

Todoran, E; Papaspyrou, N

dc.contributor.author	Todoran, E	en
dc.contributor.author	Papaspyrou, N	en
dc.date.accessioned	2014-03-01T02:48:57Z
dc.date.available	2014-03-01T02:48:57Z
dc.date.issued	2000	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34150
dc.subject	denotational semantic	en
dc.subject	Logic Programs	en
dc.subject	Parallel Composition	en
dc.subject	Parallel Logic Programming	en
dc.title	Continuations for parallel logic programming	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/351268.351297	en
heal.identifier.secondary	http://dx.doi.org/10.1145/351268.351297	en
heal.publicationDate	2000	en
heal.abstract	This paper gives denotational models for three logic programminglanguages of progressive complexity, adopting the\logic programming without logic&quot; approach. The rst languageis the control ow kernel of sequential Prolog, featuringsequential composition and backtracking. A committedchoiceconcurrent logic language with parallel composition(parallel AND) and don't care nondeterminism is studiednext. The third language is the core of Warren's basic Andorramodel, combining parallel...	en
heal.journalName	Principles and Practice of Declarative Programming	en
dc.identifier.doi	10.1145/351268.351297	en