S. Abramsky and S. Vickers. Quantales, observational logic and process semantics. Mathematical Structures in Computer Science, 1993. To appear. Revised version of Imperial College Technical Report DoC 90/1, January 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Deductive Synthesis of Recursive Plans in Linear Logic - Cresswell, Smaill, Richardson (1999) (4 citations) (Correct)
....concrete by attaching proof terms directly to the deduction rules in the style of type theory [16] This makes the relationship of deduction rules and plan formation clearer, and is easier to extend to deal with a larger subset of linear logic. A type theory has been defined for linear logic in [1]. Proof terms can be seen as programs in linear lambda calculus a functional language in which there is a restriction of using each input once. However, this allows the construction of a more powerful language than we want to deal with in a planning problem. We wish to restrict our ....
....a test at runtime, it can select between two different plans, i.e. we can build a conditional structure. Gamma; A Plan1 : C Gamma; B Plan2 : C Gamma; A Phi B if A then Plan1 B then Plan2 : C l Phi (test) This is equivalent to forms used by Bruning et al. 3] and by Abramsky [1]. If the agent cannot perform a test (cannot look at the sock) we must ensure that the same plan will work regardless of which condition holds (black or white sock) This form of planning problem has been called conformant or fail safe planning. Here we use the following form of the l Phi rule, ....
S. Abramsky. Computational interpretations of linear logic. Theoretical Computer Science, 111:3--57, 1993. (Revised version of Imperial College Technical Report DoC 90/20).
Games and Full Completeness for Multiplicative Linear Logic - Samson Abramsky And (1994) (132 citations) Self-citation (Abramsky) (Correct)
....w B B; B w A B As a consequence of this proposition, the following weakening rule is valid in the game semantics. Gamma; w A 5.2.2 Exponentials We want to define A as the type of objects which are copyable versions of objects of type A. We achieve copyability by backtracking; cf. [AV93]. That is, at any stage in a play in A, the Opponent may return to a previous stage to make his move. In this way, a single play in A will correspond to a tree of plays in A. Definition 5 A is defined as follows: A [ Theta M A ) a) P; i; a) O ffl Define s(i) s 1 ....
S. Abramsky and S. Vickers. Quantales, observational logic and process semantics. Mathematical Structures in Computer Science, 1993. To appear. Revised version of Imperial College Technical Report DoC 90/1, January 1990.
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