(Enter summary)
Abstract: We introduce a second-order polymorphic pi-calculus based on duality principles. The calculus and its behavioural theories cleanly capture some of the core elements of significant technical development on polymorphic calculi in the past. This allows precise embedding of generic sequential functions as well as seamless integration with imperative constructs such as state and concurrency. Two behavioural theories are presented and studied, one based on a second-order logical relation and the... (Update)
Similar documents based on text: More All
2.1: Genericity and the pi-Calculus - Berger, Honda, Yoshida
(Correct)
2.0: Genericity and the π-Calculus - Berger, Honda, Yoshida (2002)
(Correct)
0.5: Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001)
(Correct)
BibTeX entry: (Update)
Berger, M., K. Honda and N. Yoshida, Genericity and the pi-calculus, , 2620. http://citeseer.ist.psu.edu/berger02genericity.html More
@misc{ berger-genericity,
author = "M. Berger and K. Honda and N. Yoshida",
title = "Genericity and the pi-calculus",
text = "Berger, M., K. Honda and N. Yoshida, Genericity and the pi-calculus, ,
2620.",
url = "citeseer.ist.psu.edu/berger02genericity.html" }
Citations (may not include all citations):
1074
The Definition of Standard ML (context) - MILNER, TOFTE et al. - 1990
982
Theoretical Computer Science (context) - GIRARD - 1987
297
A calculus of mobile processes (context) - MILNER, PARROW et al. - 1992
229
Foundations for Programming Languages (context) - MITCHELL - 1996
200
Pict: A programming language based on the pi-calculus
- PIERCE, TURNER - 2000
147
abstraction and parametric polymorphism (context) - REYNOLDS - 1983
143
Theorems for free
- WADLER - 1989
137
Laboratory for Foundations of Computer Science (context) - MILNER, polyadic et al. - 1991
97
Mathematical Structures in Computer Science (context) - MILNER - 1992
56
Behavioral equivalence in the polymorphic picalculus
- SANGIORGI - 2000
56
Game-theoretic analysis of call-by-value computation
- HONDA, YOSHIDA - 1999
56
Game-theoretic analysis of call-by-value computation
- HONDA, YOSHIDA - 1997
42
Operational reasoning for functions with local state
- PITTS, STARK - 1998
39
A uniform type structure for secure information flow
- HONDA, YOSHIDA - 2002
38
Information and Computation
- HYLAND, ONG - 2000
[Article contains additional citations not shown here]
Documents on the same site (http://www.doc.ic.ac.uk/~yoshida/paper/): More
lambda f-calculus - a Functional Calculus with Shared.. - Yoshida, Honda, Tokoro
(Correct)
Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001)
(Correct)
Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001)
(Correct)
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