Constraint Logic Programming with Dynamic Scheduling: A Semantics Based on Closure Operators

The first logic programming languages, such as Prolog, used a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, provide more flexible scheduling in which there is a default computation rule such as left-to-right but in which some calls are dynamically “delayed” u...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information and computation Jg. 137; H. 1; S. 41 - 67
Hauptverfasser:	Falaschi, Moreno, Gabbrielli, Maurizio, Marriott, Kim, Palamidessi, Catuscia
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 25.08.1997 Elsevier
Schlagworte:	Applied sciences Computer science; control theory; systems Exact sciences and technology Programming languages Software Software engineering Computer programming Logic programming Denotational semantics Semantics Computer programming languages Scheduling Dynamic programming Constrained optimization
ISSN:	0890-5401, 1090-2651
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!