Genericity and the π-calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2620, Issue , 2003, Pages 103-119

  Berger, Martin ^a   Honda, Kohei ^a   Yoshida, Nobuko ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; COMPUTATION THEORY; DIFFERENTIATION (CALCULUS);

CONTEXTUAL CONGRUENCE; LABELLED TRANSITION SYSTEMS; POLYMORPHIC LAMBDA CALCULUS; SEAMLESS INTEGRATION; SEQUENTIAL FUNCTIONS; SOUND AND COMPLETE; TECHNICAL DEVELOPMENT; TRACTABLE REASONING;

CALCULATIONS;

EID: 35248866941     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_7     Document Type: Article

References (33)

1. ABADI, M., CARDELLI, L., AND CURIEN, P.-L. Formal parametric polymorphism. TCS 121, 1-2 (1993), 9-58.
2. ABRAMSKY, S., HONDA, K., AND MCCUSKER, G. Fully abstract game semantics for general reference. In LICS'98 (1998), IEEE, pp. 334-344.
3. ABRAMSKY, S., AND LENISA, M. Axiomatizing fully complete models for ML polymorphic types. In Proc. of MFCS'2000 (2000).
4. ABRAMSKY, S., AND LENISA, M. A fully-complete PER model for ML polymorphic types. In Proc. of CSL'2000, LNCS. Springer, 2000.
5. BERGER, M. Towards Abstractions for Distributed Systems. PhD thesis, Imperial College, Department of Computing, 2002.
6. ∼yoshida.
7. BERGER, M., HONDA, K., AND YOSHIDA, N. Sequentially and the π-calculus. In Proc. TLCA'01 (2001), no. 2044 in LNCS, Springer, pp. 29-45.
8. GIRARD, J.-Y. Interprétation Fonctionnelle et Élimination des Coupures de l'Arithmétique d'Ordre Supérieur. PhD thesis, Université de Paris VII, 1972.
9. GIRARD, J.-Y. Linear logic. Theoretical Computer Science 50 (1987).
10. GROSSMAN, D. Existential types for imperative languages. In ESOP02 (2002), LNCS 2305, Springer, pp. 21-35.
11. HONDA, K., AND YOSHIDA, N. Game-theoretic analysis of call-by-value computation. TCS 221 (1999), 393-456.
12. ∼kohei (2002).
13. HUGHES, D. J. D. Games and definability for system F. In LICS'97 (1997), IEEE Computer Society Press, pp. 76-86.
14. HYLAND, J. M. E., AND ONG, C. H. L. On full abstraction for PCF. Information and Computation 163 (2000), 285-408.
15. LAZIC, R., NEWCOMB, T., AND ROSCOE, A. On model checking data-independent systems with arrays without reset. Tech. Rep. RR-02-02, Oxford University, 2001.
16. LEROY, X. Polymorphic typing of an algorithmic language. PhD thesis, University of Paris, 1992.
17. MILNER, R., PARROW, J., AND WALKER, D. A calculus of mobile processes, parts I and II. Info. &. Comp. 100, 1 (1992), 1-77.
18. MILNER, R., TOFTE, M., AND HARPER, R. W. The Definition of Standard ML. MIT Press, 1990.
19. MITCHELL, J. C. On the equivalence of data representation. In Artificial Intelligence and Mathematical Theory of Computation (1991).
20. MITCHELL, J. C. Foundations for Programming Languages. MIT Press, 1996.
21. MURAWSKI, A., AND ONG, C.-H. L. Evolving games and essential nets for affine polymorphism. In Proc. of TLCA'01 (2001), no. 2044 in LNCS, Springer.
22. PIERCE, B., AND SANGIORGI, D. Behavioral equivalence in the polymorphic picalculus. Journal of ACM 47, 3 (2000), 531-584.
23. PIERCE, B. C., AND TURNER, D. N. Pict: A programming language based on the pi-calculus. In Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling, and M. Tofte, Eds. MIT Press, 2000.
24. PITTS, A., AND STARK, I. Operational reasoning for functions with local state. In HOOTS'98 (1998), CUP, pp. 227-273.
25. PITTS, A. M. Existential Types: Logical Relations and Operational Equivalence. In Proceedings ICALP'98 (1998), no. 1443 in LNCS, Springer, pp. 309-326.
26. PITTS, A. M. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10 (2000), 321-359.
27. PLOTKIN, G., AND ABACI, M. A logic for parameteric polymorphism. In LICS'98 (1998), IEEE Press, pp. 42-53.
28. REYNOLDS, J. C. Types, abstraction and parametric polymorphism. In Information Processing 83 (1983), R. E. A. Mason, Ed.
29. TOFTE, M. Type inefrence for polymorphic references. LNCS 2305, Springer, pp. 21-35.
30. TURNER, D. N. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1996.
31. VASCONCELOS, V. Typed concurrent objects. In Proceedings of ECOOP'94 (1994), LNCS, Springer, pp. 100-117.
32. YOSHIDA, N., BERGER, M., AND HONDA, K. Strong Normalisation in the π-Calculus. In LICS'01 (2001), J. Halpern, Ed., IEEE, pp. 311-322.
33. YOSHIDA, N., HONDA, K., AND BERGER, M. Linearity and bisimulation. In FoSSaCs'02 (2002), vol. 2303 of LNCS, Springer, pp. 417-433.