Genericity and the π-Calculus  (Make Corrections)  
Martin Berger, Kohei Honda, Nobuko Yoshida

 @ NUS   Home/Search   Context   Related

 
View or download:
dcs.qmul.ac.uk/~ma...ericityfull.ps.gz
Cached:  PS.gz  PS  PDF  Image  Update  Help

From:  dcs.qmul.ac.uk/%7Ema...genericity (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Types in processes delineate speci c classes of interactive behaviour in a compositional way. Key elements of process theory, in particular behavioural equivalences, are deeply a ected by types, leading to applications in the descriptions and analyses of diverse forms of computing. As one of the examples of types for processes, this paper introduces a second-order polymorphic -calculus based on duality principles, building on type structures coming from typed -calculi, Linear Logic... (Update)

Similar documents (at the sentence level):
10.0%:   Genericity and the pi-Calculus - Berger, Honda, Yoshida   (Correct)
8.0%:   Genericity and the π-Calculus - Berger, Honda, Yoshida (2002)   (Correct)

Active bibliography (related documents):   More   All
1.3:   Process Logic and Duality - Part I: Sequential Processes - Honda   (Correct)
0.7:   Processes and Games - Honda (2003)   (Correct)
0.6:   Basic Theory of Reduction Congruence for Two Timed Asynchronous.. - Berger (2004)   (Correct)

Similar documents based on text:   More   All
0.5:   Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2000)   (Correct)
0.5:   Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001)   (Correct)
0.4:   On Reduction-Based Process Semantics - Honda, YOSHIDA (1995)   (Correct)

BibTeX entry:   (Update)

@misc{ berger-genericity,
  author = "Martin Berger and Kohei Honda and Nobuko Yoshida",
  title = "Genericity and the π-Calculus",
  url = "citeseer.comp.nus.edu.sg/661860.html" }
Citations (may not include all citations):
382   Lambda calculi with types - Barendregt - 1992
297   A calculus of mobile processes (context) - Milner, Parrow et al. - 1992
294   An object calculus for asynchronous communication - Honda, Tokoro - 1991
242   Linear logic (context) - Girard - 1987
233   Computational interpretations of linear logic - Abramsky - 1993
229   Foundations for Programming Languages (context) - Mitchell - 1996
200   Pict: A programming language based on the pi-calculus - Pierce, Turner - 2000
194   Functions as processes (context) - Milner - 1992
185   De nition of Standard ML (context) - Milner, Tofte et al. - 1990
178   Making the future safe for the past: Adding genericity to th.. - Bracha, Odersky et al. - 1998
149   calculus: A tutorial (context) - Milner, polyadic - 1992
147   abstraction and parametric polymorphism (context) - Reynolds - 1983
146   Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1996
114   The Polymorphic Pi-Calculus: Theory and Implementation - Turner - 1996
99   Typed concurrent objects - Vasconcelos - 1994
89   The Lambda Calculus (context) - Barendregt - 1985
56   Game-theoretic analysis of call-by-value computation - Honda, Yoshida - 1999
56   Game-theoretic analysis of call-by-value computation - Honda, Yoshida - 1997
56   Behavioral equivalence in the polymorphic picalculus - Pierce, Sangiorgi - 2000
42   Operational reasoning for functions with local state - Pitts, Stark - 1998
38   Information and Computation - Hyland, Ong - 2000
37   Formal parametric polymorphism - Abadi, Cardelli et al. - 1993
28   the equivalence of data representation (context) - Mitchell - 1991
28   Information and Computation (context) - Abramsky, Jagadeesan et al. - 2000
23   Mathematical Structures in Computer Science (context) - Pitts - 2000
22   Principal typing scheme for polyadic - calculus - Vasconcelos, Honda - 1993
22   Existential Types: Logical Relations and Operational Equival.. - Pitts - 1998
15   A fully-complete PER model for ML polymorphic types - Abramsky, Lenisa - 2000
14   Sequentiality and the -calculus (context) - Berger, Honda et al. - 2001
14   Sequentiality and the -calculus (context) - Berger, Honda et al.
13   A uniform type structure for secure information ow (context) - Honda, Yoshida - 2002
13   Elimination des Coupures de l'Arithmetique d'Ordre Superie.. (context) - Girard - 1972
13   Linearity and bisimulation - Yoshida, Honda et al. - 2002
11   Towards Abstractions for Distributed Systems - Berger - 2002
11   Asynchrony and the pi-calculus - Boudol - 1992
10   Linear types and -calculus (context) - Kobayashi, Pierce et al. - 1996
7   Strong Normalisation in the - Calculus (context) - Yoshida, Berger et al. - 2001
5   Genericity and the -Calculus (context) - Berger, Honda et al. - 2003
4   Axiomatizing fully complete models for ML polymorphic types - Abramsky, Lenisa - 2000
4   A logic for parameteric polymorphism (context) - Plotkin, Abadi - 1998
4   On model checking data-independent systems with arrays witho.. - Lazic, Newcomb et al. - 2001
3   Evolving games and essential nets for ane polymorphism - Murawski, Ong - 2044
3   Games and de nability for system F (context) - Hughes - 1997
3   and Berger (context) - Honda, Yoshida - 2004
2   A game semantics for generic polymorphism - Abramsky, Jagadeesan - 2003
1   Speech on receiving an Honorary Degree from the University o.. (context) - Milner - 1997

Online articles have much greater impact   More about CiteSeer.IST at NUS   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.