Environmental bisimulations for higher-order languages

ACM Transactions on Programming Languages and Systems

Volumn 33, Issue 1, 2011, Pages

  Sangiorgi, Davide ^a   Kobayashi, Naoki ^b   Sumii, Eijiro ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

calculus; Bisimulation; Congruence; Higher order languages; Higher order p calculus

Indexed keywords

BASIC PROPERTIES; BASIC THEORY; BISIMILARITY; BISIMULATIONS; CALL-BY-NAME; CONGRUENCE; CONTEXTUAL EQUIVALENCE; HIGHER ORDER; HIGHER-ORDER LANGUAGES; LOGICAL RELATIONS; PROOF METHODS;

BIOMINERALIZATION; FAULT TOLERANCE; PATHOLOGY; QUALITY ASSURANCE;

CALCULATIONS;

EID: 79251560630     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1889997.1890002     Document Type: Article

References (53)

1. ABADI,M. AND GORDON, A. D. 1998. A bisimulationmethod for cryptographic protocols. In Proceedings of the European Symposium on Programming (ESOP). Lecture Notes in Computer Science, vol. 1381. Springer, 12-26.
2. ABRAMSKY, S. 1990. The lazy lambda calculus. In Research Topics in Functional Programming, D. A. Turner, Ed., Addison-Wesley, 65-117.
3. AHMED, A. 2006. Step-indexed syntactic logical relations for recursive and quantified types. In Proceedings of the European Symposium on Programming (ESOP). 69-83.
4. AHMED, A., APPEL, A. W., AND VIRGA, R. 2003. An indexed model of impredicative polymorphism and mutable references. http://www.cs.princeton.edu/ ̃amal/papers/impred.pdf.
5. AHMED, A.,DREYER, D., AND ROSSBERG, A. 2009. State-dependent representation independence. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). 340-353.
6. APPEL, A. W. AND MCALLESTER, D. 2001. An indexed model of recursive types for foundational proof-carrying code. ACM Trans. Program. Lang. Syst. 23, 5, 657-683.
7. BALDAMUS, M. AND FRAUENSTEIN, T. 1995. Congruence proofs for weak bisimulation equivalences on higher-order process calculi. Report 95-21, Computer Science Department, Berlin University of Technology.
8. BIRKEDAL, L. AND HARPER, R. 1999. Relational interpretations of recursive types in an operational setting. Inform. Comput. 155, 1-2, 3-63.
9. BOREALE, M.,DE NICOLA, R., AND PUGLIESE, R. 1999. Proof techniques for cryptographic processes. In Proceedings of the Annual IEEE Symposium on Login in Computer Science (LICS). IEEE, Computer Society Press, 157-166.
10. BOREALE, M. AND SANGIORGI, D. 1998. Bisimulation in name-passing calculi without matching. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society Press.
11. CAO, Z. 2006. More on bisimulations for higher order pi-calculus. In Proc. FoSSaCS'06. Lecture Notes in Computer Science, vol. 3921. Springer, 63-78.
12. CRARY, K. AND HARPER, R. 2000. Syntactic logical relations over polymorphic and recursive types. Draft.
13. FERREIRA, W., HENNESSY, M., AND JEFFREY, A. 1998. A theory of weak bisimulation for core CML. J. Func. Program. 8, 5, 447-491.
14. GODSKESEN, J. AND HILDEBRANDT, T. 2005. Extending Howe's method to early bisimulations for typed mobile embedded resources with local names. In Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). Lecture Notes in Computer Science, vol. 3821. Springer, 140-151.
15. GORDON, A. D. 1993. Functional programming and input/output. Ph.D. thesis, University of Cambridge.
16. HONDA, K. AND YOSHIDA, N. 1995. On reduction-based process semantics. Theor. Comput. Sci. 152, 2, 437-486.
17. HOWE, D. J. 1996. Proving congruence of bisimulation in functional programming languages. Info. Comput. 124, 2, 103-112.
18. JEFFREY, A. AND RATHKE, J. 1999. Towards a theory of bisimulation for local names. In Proceedings of the Annual IEEE Symposium on Logic in Computer Science (LICS). 56-66.
19. JEFFREY, A. AND RATHKE, J. 2004. A theory of bisimulation for a fragment of concurrent ml with local names. Theor. Comput. Sci. 323, 1-3, 1-48.
20. JEFFREY, A. AND RATHKE, J. 2005. Contextual equivalence for higher-order pi-calculus revisited. Logic. Meth. Comput. Sci. 1, 1:4, 1-22.
21. KOUTAVAS, V. AND WAND, M. 2006a. Bisimulations for untyped imperative objects. In Proceedings of the European Symposium on Programming (ESOP). 146-161.
22. KOUTAVAS, V. ANDWAND,M. 2006b. Small bisimulations for reasoning about higher-order imperative programs. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). 141-152.
23. LASSEN, S. B. 1998. Relational reasoning about functions and nondeterminism. Ph.D. thesis, Department of Computer Science, University of Aarhus.
24. LENGLET, S. 2010. Bisimulations dans les calculs avec passivation. Ph.D. thesis, Universit'e Joseph Fourier, Grenoble.
25. LENGLET, S., SCHMITT, A., AND STEFANI, J.-B. 2009. Howe's method for calculi with passivation. In Proceedings of the International Conference on Concurrency Theory (CONCUR). Lecture Notes in Computer Science, vol. 5710. 448-462.
26. MERRO, M. AND HENNESSY, M. 2002. Bisimulation congruences in Safe Ambients. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). 71-80.
27. MERRO, M. AND NARDELLI, F. Z. 2005. Behavioral theory for mobile ambients. J. ACM 52, 6, 961-1023.
28. MILNER, R. 1989. Communication and Concurrency. Prentice Hall.
29. MILNER, R. 1999. Communicating and Mobile Systems: The p-Calculus. Cambridge University Press.
30. MILNER, R. 2006. Pure bigraphs: Structure and dynamics. Inform. Comput. 204, 1, 60-122.
31. MITCHELL, J. C. 1996. Foundations for Programming Languages. MIT Press.
32. MORRIS, J. H., JR. 1968. Lambda-calculus models of programming languages. Ph.D. thesis, Massachusetts Institute of Technology.
33. ONG, L. 1988. The lazy lambda calculus: An investigation into the foundations of functional programming. Ph.D. thesis, University of London.
34. PIERCE, B. C. AND SANGIORGI, D. 2000. Behavioral equivalence in the polymorphic pi-calculus. J. ACM 47, 3, 531-586.
35. PITTS, A. 1997. Operationally-based theories of program equivalence. In Semantics and Logics of Computation, A.M. Pitts and P. Dybjer Eds., Publications of the Newton Institute., Cambridge University Press, 241-298.
36. PITTS, A. 2005. Typed operational reasoning. In Advanced Topics in Types and Programming Languages, B. C. Pierce Ed., MIT Press, Chapter 7, 245-289.
37. POUS, D. 2008. Techniques modulo pour les bisimulations. Ph.D. thesis, ENS Lyon.
38. POUS, D. AND SANGIORGI, D. Enhancements of the bisimulation proof method.
39. REYNOLDS, J. C. 1983. Types, abstraction and parametric polymorphism. In Inf. Proceedings of the IFIP 9th World Computer Congres. 513-523.
40. SANDS, D. 1998. Improvement theory and its applications. In Higher Order Operational Techniques in Semantics, A. D. Gordon and A. M. Pitts Eds., Publications of the Newton Institute, Cambridge University Press, 275-306.
41. SANGIORGI, D. 1992. Expressing mobility in process algebras: First-order and higher-order paradigm. Ph.D. thesis, University of Edinburgh.
42. SANGIORGI, D. 1994. The lazy lambda calculus in a concurrency scenario. Inform. Comput. 111, 1, 120-153.
43. SANGIORGI, D. 1996. Bisimulation for Higher-Order Process Calculi. Inform. Comput. 131, 2, 141-178.
44. SANGIORGI, D. 2001. Asynchronous process calculi: The first-order and higher-order paradigms (tutorial). Theor. Comput. Sci. 253, 311-350.
45. SANGIORGI, D., KOBAYASHI, N., AND SUMII, E. 2007. Logical bisimulations and functional languages. In Proceedings of the international Symposium on Fundamentals of Software Engineering (FSEN). Lecture Notes in Computer Science, vol. 4767. Springer, 364-379.
46. SANGIORGI, D. AND WALKER, D. 2001. The p-calculus: A Theory of Mobile Processes. Cambridge University Press.
47. SCHMITT, A. AND STEFANI, J.-B. 2004. The kell calculus: A family of higher-order distributed process calculi. In Proceedings of the International Conference on Global Computing. Lecture Notes in Computer Science, vol. 3267. Springer, 146-178.
48. STØVRING, K. AND LASSEN, S. B. 2007. A complete, co-inductive syntactic theory of sequential control and state. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL). 161-172. To appear.
49. SUMII, E. 2009. A complete characterization of observational equivalence in polymorphic ?- calculus with general references. In Proceedings of the International Conference on Computer Science Logic, Lecture Notes in Computer Science, vol. 5771, Springer-Verlag, 455-469.
50. SUMII, E. AND PIERCE, B. C. 2003. Logical relations for encryption. J. Comput. Secu. 11, 4, 521-554.
51. SUMII, E. AND PIERCE, B. C. 2007a. A bisimulation for dynamic sealing. Theor. Comput. Sci. 375, 1- 3, 169-192.
52. SUMII, E. AND PIERCE, B. C. 2007b. A bisimulation for type abstraction and recursion. J. ACM54, 5.
53. THOMSEN, B. 1993. Plain CHOCS, a second generation calculus for higher-order processes. Acta Informatica 30, 1-59.