G. Levi and D. Micciancio. Analysis of pure PROLOG programs. Technical report, Comp. Sci. Dept. University of Pisa, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Operational and Goal-Independent Denotational Semantics for Prolog .. - Spoto (2 citations) (Correct)
....remove all the following atoms observed in the computation. Note that the semantic domain consists of sequences rather than sets of atoms, so as to model the relation between atoms implied by the backtracking semantics of Prolog. A further development of the semantics in [3] can be found in [18] and in [19] where the s semantics [4] is extended to deal with the cut operator. The semantic domain is very complex, since any constraint is associated with a history and a cutpoint. In the present work we show how this information can safely be discarded. 3 Preliminaries We assume the reader ....
G. Levi and D. Micciancio. Analysis of Pure Prolog Programs. In M.I. Sessa, editor, Proceedings GULP-PRODE '95, 1995 Joint Conference on Declarative Programming, 1995.
Modelling PROLOG Control in Constraint Logic Languages - Levi, Micciancio (1994) Self-citation (Levi Micciancio) (Correct)
....semantic related issues, here control strategy. Using this framework we define a semantics for CLP that takes into account the prolog search rule, that is the left most selection rule and depth first search strategy. The semantics we present here is a reconstruction in the style of [10] of that in [9]. Our first formulation ( 9] was a refinement of [2] We chose to translate our semantics in the language of [10] because its structured approach seems to yield a more clean formulation. The paper is organized as follows. In section 2 we recall some notions from the theory of lattices and ....
....control strategy. Using this framework we define a semantics for CLP that takes into account the prolog search rule, that is the left most selection rule and depth first search strategy. The semantics we present here is a reconstruction in the style of [10] of that in [9] Our first formulation ([9]) was a refinement of [2] We chose to translate our semantics in the language of [10] because its structured approach seems to yield a more clean formulation. The paper is organized as follows. In section 2 we recall some notions from the theory of lattices and orders that will be used in the ....
[Article contains additional citation context not shown here]
G. Levi and D. Micciancio. Analysis of pure PROLOG programs. Technical report, Comp. Sci. Dept. University of Pisa, 1994.
A Denotational Semantics for Prolog - Spoto, Levi Self-citation (Levi) (Correct)
....remove all the following atoms observed in the computation. Note that the semantic domain consists of sequences rather than sets of atoms, in order to model the relation between atoms implied by the backtracking semantics of Prolog. A further development of the semantics in [4] can be found in [12], where the problem of the abstract semantics (useful for program analysis) is tackled, and the new feature of downward approximation of constraints is introduced; A further development of this line of research is [13] where the semantics is extended to deal with the cut operator and an ....
G. Levi and D. Micciancio. Analysis of pure PROLOG programs. In M.I. Sessa, editor, Proceedings GULP-PRODE '95, 1995 Joint Conference on Declarative Programming, pages 521--532, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC