Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been introduced to describe scheduling while abstracting from the technical details. In this paper we review and compare the different proposal given for denotational semantics of programs with input consuming derivations. We also show how they can be applied to termination analysis. Titolo del volume: Program Development in Computational Logic M. Bruynooghe, K-K. Lau (Eds.)
Autori: | |
Data di pubblicazione: | 2004 |
Titolo: | Declarative Semantics of Input Consuming Logic Programs |
Titolo del libro: | Program Development in Computational Logic |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1007/b98187 |
Appare nelle tipologie: | 3.1 Articolo su libro |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
BCER_04.pdf | Documento in Post-print | Accesso chiuso-personale | Riservato |
I documenti in ARCA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.