Laneve C. Optimality and Concurrency in Interaction Systems. Ph.D. Thesis, University of Pisa, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(graph grammars) are linear no duplication and no erasure of redexes are possible. It is well known that PESs are inadequate to give account to erasure of redexes, and a L evyequivalence class of reductions cannot be interpreted by a single configuration. This problem is well discussed in [Lan93], Chapter 8. To cope with that problem (caused by erasure) in [KhGl96a] we extend the conflict free PES model with an axiomatized L evy equivalence relation in two different but equivalent ways: One by directly constraining the class of all equivalence relations on configurations, and another by ....

Laneve C. Optimality and Concurrency in Interaction Systems. Ph.D. Thesis, University of Pisa, 1993.

....and extra axioms on stable DRSs may be needed to ensure it. We expect that a similar extraction algorithm will be applicable, but proofs will become more complicated. Event Structure semantics for orthogonal rewrite systems with duplicating residual relation are studied, among others, in [LaMo92, Lan93], but the results there are limited because of the problems with erasure illustrated by the example in Section 6. Second, it is natural to extend DPESs with an axiomatized erasure relation or an axiomatized permutationequivalence relation to enable DPESs to give an adequate semantics to ....

....the previous section. This is indeed possible, and in an forthcoming paper we show that such refined event models are isomorphic to affine DFSs, therefore can serve as faithful event models for orthogonal rewrite systems. This approach, in particular, solves the problems with erasure discussed in [Lan93], Chapter 8, and in [KKSV93] Finally, we mention that non deterministic Residual Structures must be considered as well. For example, normalization by neededness theory for non orthogonal systems is studied in Boudol [Bou85, Mel96] and constructions of Event Structures from non orthogonal graph ....

Laneve C. Optimality and Concurrency in Interaction Systems. Ph.D. Thesis, University of Pisa, 1993.

....L evy 1980] thus defining the amount of sharing an optimal evaluator is required to perform. We comfort our notion of family by approaching to it in two different ways (generalizing labeling and extraction in [L evy 1980] and proving their coincidence. The reader is referred to [Asperti and Laneve 1993c] for the paradigmatic description of optimal evaluators of IS s. 1 Introduction In 1978, L evy introduced the notion of redex family in the calculus with the aim of formalizing the phenomenon of duplication of redexes, thus providing an abstract definition of what could be considered as an ....

....The contexts Gamma i , Delta have different variable names. We remark that the above rules have the general shape of the so called multiplicative connectives (implication, conjunction, etc. As in IN s, there is no means to represent directly additives (disjunction, etc. see Section 3.2. 1 in [Laneve 1993]) The IS expressions are exactly those encoding proofs of the above systems (those in the rhs of the lower sequents in the rules) when any typing constraint is removed. For instance, calculus is obtained from an intuitionistic system defining the implication: left ) Delta t : A z : B; ....

[Article contains additional citation context not shown here]

C. Laneve (1993) Optimality and Concurrency in Interaction Systems. PhD thesis, Dip. Informatica, Universit`a di Pisa. Technical Report TD -- 8/93.

....L evy 1980) thus defining the amount of sharing an optimal evaluator is required to perform. We comfort our notion of family by approaching to it in two different ways (generalizing labeling and extraction in (L evy 1980) and proving their coincidence. The reader is referred to (Asperti and Laneve 1993c) for the paradigmatic description of optimal evaluators of IS s. 1. Introduction In 1978, L evy introduced the notion of redex family in the calculus with the aim of formalizing the phenomenon of duplication of redexes, thus providing an abstract definition of what could be considered as an ....

....a long time, no implementation was able to achieve the theoretical performance y An extended abstract of this paper is appeared in the proceedings of Theoretical Aspects of Computer Science 1994. This work is partially supported by the ESPRIT Basic Research Project 6454 CONFER. A. Asperti and C. Laneve 2 fixed by L evy (see (Field 1990) for a survey) and it is only in recent years that this problem has been finally solved (Lamping 1990; Kathail 1990) In particular, the graph reduction technique proposed by Lamping, and remarkably simplified in (Gonthier et al. 1992a) has put in evidence a ....

[Article contains additional citation context not shown here]

C. Laneve (1993) Optimality and Concurrency in Interaction Systems. PhD thesis, Dip. Informatica, Universit`a di Pisa. Technical Report TD -- 8/93.

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