Jean-Yves Girard. Linear logic and parallelism. In Mathematical Models for the Semantics of Parallelism, LNCS 280, Springer Verlag, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An implementation model of the typed lambda-calculus based on.. - Sato, al. (2001) (Correct)
....model of Linear CHAM based on Abramsky s idea of a stack of coequations and a name queue, and then we consider a concurrent multi thread implementation of the model. 1 Introduction Girard s Classical Linear Logic (CLL) 6] is expected to give new theoretical foundations of parallel computation [7]. Abramsky [1] gave a computational interpretation of CLL using the framework of Berry and Boudol s Chemical Abstract Machine (CHAM) 3] In this computational system which is called Linear Chemical Abstract Machine (Linear CHAM) proof expressions are assigned to proof trees in CLL, and they are ....
Jean-Yves Girard. Linear logic and parallelism. In Mathematical Models for the Semantics of Parallelism, LNCS 280, Springer Verlag, 1987.
The Geometry of Optimal Lambda Reduction - Gonthier, Abadi, Lévy (1992) (73 citations) (Correct)
....some of his nodes. The nodes are those presented in the introduction: T root void i croissant i bracket i fan 3.2 Reduction The rules for reduction are particularly simple, since we want not to be ridiculous. To our knowledge, Girard was the first to write on the desire not to be ridiculous [Girb]; we continue his work in this respect too. In the rules, given in Figure 1, it is assumed that 0 i j. Because of the form of these rules, we are dealing with interaction nets. An immediate consequence is that the system is Church Rosser, as there are no critical pairs. Interaction nets have ....
Jean-Yves Girard. Linear logic and parallelism.
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