A bisimulation for type abstraction and recursion

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2005, Pages 63-74

  Sumii, Eijiro ^a   Pierce, Benjamin C ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Bisimulations; Contextual Equivalence; Existential Types; Lambda Calculus; Logical Relations; Recursive Types

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING; SEMANTICS; SYNTACTICS;

ABSTRACTION; LAMBDA-CALCULUS; LOGICAL RELATIONS; RECURSION; RECURSIVE TYPES;

COMPUTER SIMULATION;

EID: 29144437303     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1040305.1040311     Document Type: Conference Paper

References (43)

1. M. Abadi and C. Fournet. Mobile values, new names, and secure communication. In Proceedings of the 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 104-115, 2001.
2. M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. Nordic Journal of Computing, 5:267-303, 1998.
3. Preliminary version appeared in 7th European Symposium on Programming, Lecture Notes in Computer Science, Springer-Verlag, vol. 1381, pp. 12-26, 1998.
4. M. Abadi and A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148(1):1-70, 1999.
5. Preliminary version appeared in Proceedings of the 4th ACM Conference on Computer and Communications Security, pp. 36-47, 1997.
6. S. Abramsky. The lazy lambda calculus. In D. A. Turner, editor, Research Topics in Functional Programming, pages 65-117. Addison-Wesley, 1990.
7. A. Ahmed, A. W. Appel, and R. Virga. An indexed model of impredicative polymorphism and mutable references, http://www.cs.princeton.edu/~amal/papers/impred.pdf, 2003.
8. A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems, 23(5):657-683, 2001.
9. M. Berger, K. Honda, and N. Yoshida. Genericity and the pi-calculus. In Foundations of Software Science and Computation Structures, volume 2620 of Lecture Notes in Computer Science, pages 103-119. Springer-Verlag, 2003.
10. G. M. Bierman, A. M. Pitts, and C. V. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. In Higher Order Operational Techniques in Semantics, volume 41 of Electronic Notes in Theoretical Computer Science. Elsevier Science, 2000.
11. L. Birkedal and R. Harper. Relational interpretations of recursive types in an operational setting. Information and Computation, 155(1-2):3-63, 1999.
12. Summary appeared in Theoretical Aspects of Computer Software, Lecture Notes in Computer Science, Springer-Verlag, vol. 1281, pp. 458-490, 1997.
13. M. Boreale, R. De Nicola, and R. Pugliese. Proof techniques for cryptographic processes. SIAM Journal on Computing, 31(3):947-986, 2002.
14. Preliminary version appeared in 14th Annual IEEE Symposium on Logic in Computer Science, pp. 157-166, 1999.
15. J. Borgström and U. Nestmann. On bisimulations for the spi calculus. In 9th International Conference on Algebraic Methodology and Software Technology, volume 2422 of Lecture Notes in Computer Science, pages 287-303. Springer-Verlag, 2002.
16. K. B. Bruce, L. Cardelli, and B. C. Pierce. Comparing object encodings. Information and Computation, 155(1-2):108-133, 1999.
17. Extended abstract appeared in Theoretical Aspects of Computer Software, Springer-Verlag, vol. 1281, pp. 415-338, 1997.
18. K. Crary and R. Harper. Syntactic logical relations over polymorphic and recursive types. Draft, 2000.
19. A. D. Gordon. Bisimilarity as a theory of functional programming, mini-course, http://research.microsoft.com/~adg/Publications/BRICS-NS-95-3.dvi.gz, 1995.
20. A. D. Gordon. Operational equivalences for untyped and polymorphic object calculi. In Higher Order Operational Techniques in Semantics, pages 9-54, 1995.
21. A. D. Gordon and G. D. Rees. Bisimilarity for F:. Draft, 1995.
22. A. D. Gordon and G. D. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 386-395, 1996.
23. N. Heintze and J. G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1998.
24. D. J. Howe, Proving congruence of bisimulation in functional programming languages, Information and Computation, 124(2):103-112, 1996.
25. D. J. Hughes. Games and definability for System F. In Twelfth Annual IEEE Symposium on Logic in Computer Science, pages 76-86, 1997.
26. R. Milner. A Calculus of Communicating Systems. Springer-Verlag, 1980.
27. R. Milner. Communication and Concurrency. Springer-Verlag, 1995.
28. R. Milner. Communicating and Mobile Systems: The π-Calculus. Cambridge University Press, 1999.
29. J. C. Mitchell. Foundations for Programming Languages. MIT Press, 1996.
30. E. Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
31. J. H. Morris, Jr. Protection in programming languages. Communications of the ACM, 16(1):15-21, 1973.
32. J. H. Morris, Jr. Types are not sets. In Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 120-124, 1973.
33. B. C. Pierce and D. Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. Journal of the ACM, 47(3):531-586, 2000.
34. Extended abstract appeared in Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1997, pp. 531-584.
35. A. M. Pitts. Existential types: Logical relations and operational equivalence. In Automata, Languages and Programming, volume 1443 of Lecture Notes in Computer Science, pages 309-326. Springer-Verlag, 1998.
36. A. M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in Computer Science, 10:321-359, 2000.
37. Preliminary version appeared in HOOTS II Second Workshop on Higher-Order Operational Techniques in Semantics, Electronic Notes in Theoretical Computer Science, vol. 10, 1998.
38. A. M. Pitts and I. Stark. Operational reasoning for functions with local state. In Higher Order Operational Techniques in Semantics, pages 227-273. Cambridge University Press, 1998.
39. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigm. PhD thesis, University of Edinburgh, 1992.
40. D. Sangiorgi and R. Milner. The problem of "weak bisimulation up to". In CONCUR '98, Third International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 32-46. Springer-Verlag, 1992.
41. E. Sumii and B. C. Pierce. A bisimulation for dynamic sealing. In Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 161-172, 2004.
42. E. Sumii and B. C. Pierce. A bisimulation for type abstraction and recursion. Technical Report MS-CIS-04-27, Department of Computer and Information Science, University of Pennsylvania, 2004. http://www.cis.upenn.edu/~sumii/pub/.
43. P. Wadler. Theorems for freel In Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, pages 347-359. ACM, 1989.