Full abstraction for polymorphic π-calculus

Theoretical Computer Science

Volumn 390, Issue 2-3, 2008, Pages 171-196

  Jeffrey, Alan ^a   Rathke, Julian ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INFORMATION ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING;

LOGICAL RELATIONS; POLYMORPHIC CONCURRENT LANGUAGE;

POLYMORPHISM;

EID: 37849042829     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.09.020     Document Type: Article

References (30)

1. Abadi M., and Cardelli L. A Theory of Objects (1996), Springer-Verlag
2. Barendregt H.P. The Lambda Calculus, its Syntax and Semantics (1984), North-Holland
3. Berger M., Honda K., and Yoshida N. Genericity and the π-calculus. Proc. Int. Conf. Foundations of Software Science and Computer Structures. FoSSaCs. Lecture Notes in Computer Science (2003), Springer-Verlag
4. Brookes S.D., Hoare C.A.R., and Roscoe A.W. A theory of communicating sequential processes. Journal of the ACM 31 3 (1984) 560-599
5. Canning P., Cook W., Hill W., Olthoff W., and Mitchell J.C. F-bounded polymorphism for object-oriented programming. Proc. Int. Conf. Functional Programming Languages and Computer Architecture. FPCA (1989), ACM Press 273-280
6. Coppo M., and Dezani-Ciancaglini M. A new type-assignment for λ-terms. Archive for Mathematical Logic 19 (1978) 139-156
7. Microsoft Corporation, ECMA and ISO/IEC C# and common language infrastructure standards, 2004. http://msdn.microsoft.com/net/ecma/
8. Fournet C., and Gonthier G. A hierarchy of equivalences for asynchronous calculi. Proc. Int. Conf. Automata, Languages and Programming. ICALP. Lecture Notes in Computer Science vol. 1443 (1998), Springer-Verlag
9. Fournet C., Gonthier G., Levy J.-J., Maranget L., and Remy D. A calculus of mobile agents. Proc. Int. Conf. Concurrency Theory. CONCUR. Lecture Notes in Computer Science vol. 1119 (1996), Springer-Verlag
10. Girard J.-Y., Taylor P., and Lafont Y. Proofs and Types (1989), Cambridge University Press
11. Hennessy M. Algebraic Theory of Processes (1988), MIT Press
12. Hennessy M., and Riely J. Resource access control in systems of mobile agents. Information and Computation 173 1 (2002) 82-120
13. Honda K., and Yoshida N. On reduction-based process semantics. Theoretical Computer Science 152 2 (1995) 437-486
14. Jeffrey A.S.A., and Rathke J. A fully abstract may testing semantics for concurrent objects. Proc. IEEE Logic in Computer Science (2002), IEEE Press 101-112 Full version to appear in Theoretical Computer Science
15. Jeffrey A.S.A., and Rathke J. Contextual equivalence for higher-order π-calculus revisited. Proc. Mathematical Foundations of Programming Semantics. Electronic Notes in Computer Science (2003), Elsevier
16. Sun Microsystems, Release notes Java 2 platform standard edition development kit 5.0, 2004. http://java.sun.com/j2se/1.5.0/relnotes.html
17. Milner R. Fully abstract models of typed lambda-calculi. Theoretical Computer Science 4 (1977) 1-22
18. Milner R. Communication and Concurrency (1989), Prentice-Hall
19. Milner R. Communication and Mobile Systems: The π-Calculus (1999), Cambridge University Press
20. Milner R., Parrow J., and Walker D. A calculus of mobile processes, Part I + II. Information and Computation 100 1 (1992) 1-77
21. Milner R., and Sangiorgi D. Barbed bisimulation. Proc. Int. Conf. Automata, Languages and Programming. ICALP. Lecture Notes in Computer Science vol. 623 (1992), Springer-Verlag
22. Pierce B.C., and Sangiorgi D. Behavioral equivalence in the polymorphic π-calculus. Journal of the ACM 47 3 (2000) 531-584
23. Pitts A.M. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science 10 (2000) 321-359
24. Plotkin G.D. LCF considered as a programming language. Theoretical Computer Science 5 (1977) 223-255
25. Reynolds J.C. Types, abstraction and parametric polymorphism. Information Processing 83 (1983) 513-523
26. Reynolds J.C. An introduction to logical relations and parametric polymorphism (abstract). Proc. ACM Symp. Principles of Programming Languages (1993), ACM Press 155-156
27. Reynolds J.C. Theories of Programming Languages (1998), Cambridge University Press
28. Sangiorgi D., and Walker D. The Pi-Calculus: A Theory of Mobile Processes (2001), Cambridge University Press
29. E. Sumii, B.C. Pierce, A bisimulation for type abstraction and recursion, in: Proc. ACM Symp. Principles of Programming Languages, 2005, pp. 63-74
30. Wadler P. Theorems for free!. Proc. Int. Conf. Functional Programming Languages and Computer Architecture. FPCA (1989), ACM Press, New York 347-359