E.P. de Vink, "Comparative Semantics for Prolog with Cut," Report IR-166, Vrije Universiteit, Amsterdam (1988). To appear in Science of Computer Programming Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Retractions in Comparing Prolog Semantics - de Bruin, de Vink (1989) (2 citations) Self-citation (De vink) (Correct)
....will proceed more smoothly when using continuations and secondly, the language B that will be studied in the sequel cannot be given a satisfactory direct semantics. In order to model the cut operator this way one has to resort to cut flags or other kinds of indicators. See [JM] DM] Bd] [Vi]. Our meaning function D is defined as the least fixed point of a higher order operator Y. In fact, it does not matter much how D is defined (as long as it remains denotational) the more usual approach based on environments as in [Ba1]a would work equally well, cf. 6. BM]a. The style of ....
....Semantics and Denotational Semantics for B In this section we introduce the abstract backtracking language B. This uniform language was studied also in [BV]a for it captures the control flow of Prolog with cut, the latter being the main interest of the particular paper. See also [BaKo] [Vi]a, Ba2]a for similar uses of intermediate abstracta in deriving sound denotational semantics for logic programming languages. In the present paper however, we will focus on the residue B itself to serve as a case study for our method of comparing operational and denotational semantics. 4.1) ....
E.P. de Vink, "Comparative Semantics for Prolog with Cut," Report IR-166, Vrije Universiteit, Amsterdam (1988). To appear in Science of Computer Programming
Denotational Semantics for Unguarded Recursion: The Demonic Case - de Bruin, de Vink (1990) Self-citation (De vink) (Correct)
....a(x y ) Define on P (A st ) as the extended and lifted version of on A f . Having now available semantical interpretations for our syntactical operators we can proceed 9 with the definition of the denotational semantics for Prog. It follows the same general scheme as in, e.g. BM] [Vi1]. 4.2) DEFINITION Define the collection of environments Env, with typical element h, by Env = X P (A st ) Define the statement evaluator S: Stat Env P (A st ) by S(a ) h) a , S(x ) h) h(x ) S(s 1 s 2 ) h) S(s 1 ) h) S(s 2 ) h) for , Let for d ....
E.P. de Vink, "Comparative Semantics for Prolog with Cut," Science of Computer Programming 13, pp. 237-264 (1989/90).
Transition System Specifications in Stalk Format With.. - van Oostrom, de Vink (1994) (1 citation) Self-citation (De vink) (Correct)
....E, representing termination, there is no rule or axiom. Example 3.8 The next transition system specification exemplifying the stalk format, is a specification for ( Sigma cut ; cut ) The system is used, in the literature, for an operational model for the flow of control of Prolog with cut. See [Bak91, Vin90, BV89]. The various classes of terms playing a role, can (as alternative to the description of Example 3.2) be summarized by the BNF s (2 S) ff j j fail j s ; s j s s j r (2 R) E j u : r t (2 T ) Delta j r t u (2 U) s t with ff a meta variable ranging over A, a ....
E.P. de Vink. Comparative semantics for Prolog with cut. Science of Computer Programming, 13:341--383, 1990.
Asynchronous Rendez-Vous in Distributed Logic Programming - Eliëns, de Vink (1993) Self-citation (De vink) (Correct)
.... programming language under consideration has been shown profitable in, e.g. Kok, 1988] and [de Bruin and de Vink, 1989] Since the semantics for (the core of) Prolog including the cut operator, and therefore of individual DLP objects, has been extensively studied in [Jones and Mycroft, 1984] [de Vink, 1990] and [de Bakker, 1991] attention is given primarily to the creation of processes and the flow of control during communication. Complementary to the approach followed here one could stress the logical aspects of DLP by studying a declarative semantics as done, e.g. for contextual logic ....
E.P. de Vink, Comparative semantics for Prolog with cut, Science of Computer Programming 13 (1990), pp. 237-264
Metric Predicate Transformers: Towards a Notion of.. - Bonsangue, de Vink, Kok (1994) Self-citation (De vink) (Correct)
....checked. It is ultimately based on the monotonicity of ; and 2 I . Since Pi 1 is a complete partial order, we have that also Env 1 is a complete partial order. Therefore for every declaration d 2 Decl 1 the function H d has least fixed point [HP72] The technique is adapted from [Vin90]. Note that this way environments as place holders for temporary meanings of procedure variables intricate problems induced by the cardinality of L 1 are avoided. 5.8. Lemma. The weakest precondition semantics wp 1 [ Delta] L 1 Pi 1 defined in Definition 5.7 is the least function in ....
E.P. de Vink. Comparative semantics for Prolog with cut. Science of Computer Programming, 13:237--264, 1989/90.
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