Bellin, G., and Scott, P.J., On the Pi-calculus and linear logic, TCS, Vol. 135, pp. 11-65, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
.... in [66] An even wider class of SN interactions would be typable if we further allowed edges of the more general form px qy, where p 2 f#; g and q 2 f ;#; g (i.e. replicated and linear nodes can be mixed) Diverse structures would be embeddable in such an extension, including full proof nets [9]. The status of strong reduction would become subtle in this setting, cf. 22] Game Semantics. In game semantics, winning strategies represent strong normalisation [3] This representation ensures, essentially by definition, that composition of two winning strategies will never go into ....
Bellin, G., and Scott, P.J., On the Pi-calculus and linear logic, TCS, Vol. 135, pp. 11-65, 1994.
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
.... as in [47] An even wider class of SN interactions would be typable if we further allowed edges of the more general form px qy, where p 2 f#; g and q 2 f ;#; g (i.e. replicated and linear nodes can be mixed) Diverse structures would be embeddable in this extension, including full proof nets [8]. The status of strong reduction would become subtle in this setting, cf. 14] Second order and Other Extensions Can the presented results be augmented to cover more expressive notions of types studied in functional calculi Adding recursive types [34, 45] easily leads to a system that is not ....
Bellin, G., and Scott, P.J., On the Pi-calculus and linear logic, TCS, Vol. 135, pp. 11-65, 1994.
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
.... in [48] An even wider class of SN interactions would be typable if we further allowed edges of the more general form px qy, where p 2 f#; g and q 2 f ;#; g (i.e. replicated and linear nodes can be mixed) Diverse structures would be embeddable in such an extension, including full proof nets [8]. The status of strong reduction would become subtle in this setting, cf. 15] Second order and Other Extensions Can the presented results be augmented to cover more expressive notions of types studied in functional calculi Adding recursive types [35, 46] easily leads to a system that is not ....
Bellin, G., and Scott, P.J., On the Pi-calculus and linear logic, TCS, Vol. 135, pp. 11-65, 1994.
Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (1 citation) (Correct)
.... as in [48] An even wider class of SN interactions would be typable if we further allowed edges of the more general form px qy, where p 2 f#; g and q 2 f ;#; g (i.e. replicated and linear nodes can be mixed) Diverse structures would be embeddable in this extension, including full proof nets [8]. The status of strong reduction would become subtle in this setting, cf. 15] Second order and Other Extensions Can the presented results be augmented to cover more expressive notions of types studied in functional calculi Adding recursive types [35, 46] easily leads to a system that is not ....
Bellin, G., and Scott, P.J., On the Pi-calculus and linear logic, TCS, Vol. 135, pp. 11-65, 1994.
The Algebraic Theory of Interaction Nets - Banach (1995) (6 citations) (Correct)
....for which a type discipline different to that proposed by Lafont is appropriate. This reformulation brings the essentially combinatorial nature of (at least this fragment of) LL into stark relief. It has been noted that LL often has little to do with logic and much to do with plugging (see e.g. Bellin and Scott (1994)) In a sense, this paper takes the plugging approach to an extreme, by banishing logic to the background. 2 AGENTS, PORTS AND CONNECTION GRAPHS An agent is an entity which typically has a label and a (label dependent) set of ports e.g. Fig. 1. Here Fred is the label and a. f are the ports. ....
Bellin G., Scott P.J. (1994), On the Pi-Calculus and Linear Logic, Theoretical Computer Science, 135, 11-65.
A Survey of Linear Logic Programming - Dale Miller (1995) (6 citations) (Correct)
....can be equated and that the normalization of proofs (say, by beta conversion or cut elimination) can be seen as computation. Linear logic supplies new proof structures, called proof nets, and the dynamics of their normalization can be used to express some aspects of concurrency [Abramsky 1993, Bellin Scott 1992, Lafont 1989, Lafont 1990] The Curry Howard Isomorphism also states that the types of programs can be seen as formulas, and the richer formulas of linear logic allow for more expressive types. Such stronger types have been used to help provide static analysis of such things as run time garbage, ....
G. Bellin and P. J. Scott. On the pi-calculus and linear logic. Manuscript, 1992.
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