J.W. de Bakker and J.N. Kok. Comparative metric semantics for concurrent prolog. Theoretical Computer Science, 75:15--43, 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for asynchronous communication. The motivation for extension with an atomizer comes from two sources: First, in concurrent logic languages like CP [Sha88] GHC [Ued88] and PARLOG [KG86] we have implicitly an atomizer: the evaluation of a guard has to be interpreted as an atomic action. In [dBK90] it has been shown how CP can be seen as an instantiation of a language L. The language L enables us to study the semantic issues involved at a more abstract level. The main ingredient is the extension of boolean guards. Already in [dB80] it is argued that boolean expressions should be seen as a ....

....1 ab ab option 2 ab ab; affi If we choose the first option for the atomizer, the two different options for coincide. In the next table we indicate where the semantic issues are studied and if a branching time (BT) or linear time (LT) model is used. h Deltaioption 1 h Deltaioption 2 option 1 [dBK90], BT open option 2 [dBK90] BT this paper; LT 4 Inspired by Concurrent Logic Languages we study in this paper the second options for the choice and the atomizer. The paper is organized as follows. First we give a uniform version of the language L. in which we are studying the meaning of the ....

[Article contains additional citation context not shown here]

J.W. de Bakker and J.N. Kok. Comparative metric semantics for concurrent prolog. Theoretical Computer Science, 75:15--43, 1990.

....consider the infinite process fh1; ai : a 2 Ag [ f g. Since the recursion is guarded, this process can never be obtained as the denotation of a program. An important feature of process algebras is the so called silent move , which is used to model a step or a sequence of steps local to a process [BW91, dBK90, Mil89]. Axioms for include ; x x = x. It is readily seen that this axiom prevents us from modeling the semantic choice operator by a continuous function. Hence we cannot extend our model to cover this extension of the algebra. It is an interesting question which kind of structure we should use in ....

J.W. de Bakker and J.N. Kok. Comparative metric semantics for Concurrent Prolog. Theoretical Computer Science, 75:15--43, 1990.

....between declarative and operational semantics of logic programs, the second to deal also with some metalogical, built in relations. Our contribution is related to those approaches which employ mathematical concepts and techniques traditionally applied in the imperative setting. In particular, in [dV90], dBK90] and [dB91] the semantics of various logic programming languages is investigated by distinguishing between the logic and the control part of a program. Since their aim is to compare logic programming languages with various control features, they focus on the study of the control part, by ....

E.P. de Vink. Comparative metric semantics of concurrent prolog. Science of Computer Programming, 13:237--264, 1990.

....declarative and operational semantics of logic programs, the second to deal also with some metalogical, built in relations. Our contribution is related to those approaches which employ mathematical concepts and techniques traditionally applied in the imperative setting. In particular, in [dV90] [dBK90] and [dB91] the semantics of various logic programming languages is investigated by distinguishing between the logic and the control part of a program. Since their aim is to compare logic programming languages with various control features, they focus on the study of the control part, by ....

J.W. de Bakker and J. N. Kok. Comparative metric semantics of concurrent Prolog. Theoretical Computer Science, 75:15--43, 1990.

....GHC [Ued88] and PARLOG [CG86] one implicitly has an atomizer: the evaluation of a guard has to be interpreted as an atomic action, in order to avoid distributed backtracking. This is especially important if one allows non flat guards, that is, arbitrary, possibly recursive, expressions. In [dBK90] it has been shown how CP can be seen as an instantiation of the language studied in this paper. Closely related are boolean guards as used in, for example, CSP [Hoa85] where a distinction is made between statements and booleans. For example, a conditional in CSP has the following form: b 1 s ....

....and h Deltai option 2, we do not have the general Atomized Statements and Parallel Choice 5 property that s s = s. In the next table we indicate where the semantic issues are studied and if a branching time (BT) or linear time (LT) model is used. h Deltai option 1 h Deltai option 2 option 1 [dBK90], BT open option 2 [dBK90] BT this paper, LT Since in this paper we want to define a model that is suited for giving a semantics to Concurrent Logic Languages, we will adopt the second options for the choice and the atomizer. In Section 4 it is shown how to embed Concurrent Logic Languages in ....

[Article contains additional citation context not shown here]

J.W. de Bakker and J.N. Kok. Comparative metric semantics for Concurrent Prolog. Theoretical Computer Science, 75:15--43, 1990.

....as ask tell primitives. Concurrent logic languages, like Flat Concurrent Prolog [Sha89] can be obtained as instances of L by interpreting the proper states (excluding suspension and failure) as the bindings established on the logical variables, and the actions as the unification steps (see [dBK90]) Apart from the concurrent constraint languages, many languages for asynchronously communicating processes can be obtained as instances of L by choosing the appropriate set of actions, the set of (proper) states and the interpretation of the basic actions. For example, the imperative language ....

J.W. de Bakker and J.N. Kok. Comparative metric semantics for concurrent prolog. Theoretical Computer Science, 75:15--43, 1990.

No context found.

de Bakker, J. and Kok, J. (1990). Comparative metric semantics for Concurrent Prolog. Theoretical Computer Science, 75(1/2):15--44.

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