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...

Celý popis

Podrobná bibliografie

Vydáno v:	Information and computation Ročník 137; číslo 1; s. 41 - 67
Hlavní autoři:	Falaschi, Moreno, Gabbrielli, Maurizio, Marriott, Kim, Palamidessi, Catuscia
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 25.08.1997 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!