Logical bisimulations and functional languages

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

Volumn 4767 LNCS, Issue , 2007, Pages 364-379

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

^a UNIVERSITY OF BOLOGNA   (Italy)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; FORMAL LOGIC;

BISIMULATION PROOF; FUNCTIONAL LANGUAGES; LOGICAL BISIMILARITY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 38149036433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75698-9_24     Document Type: Conference Paper

References (29)

1. Morris, Jr., J.H.: Lambda-Calculus Models of Programming Languages. PhD thesis, Massachusetts Institute of Technology (1968)
2. Abramsky, S.: The lazy lambda calculus. In: Turner, D.A. (ed.) Research Topics in Functional Programming, pp. 65-117. Addison-Wesley, Reading (1990)
3. Gordon, A.D.: Functional Programming and Input/Output. PhD thesis, University of Cambridge (1993)
4. Gordon, A.D., Rees, G.D.: Bisimilarity for a first-order calculus of objects with subtyping. In: Proceedings of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 386-395. ACM Press, New York (1996)
5. Pitts, A.: Operationally-based theories of program equivalence. In: Pitts, A.M., Dybjer, P. (eds.) Semantics and Logics of Computation. Publications of the Newton Institute, pp. 241-298. Cambridge University Press, Cambridge (1997)
6. Sands, D.: Improvement theory and its applications. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics. Publications of the Newton Institute, pp. 275-306. Cambridge University Press, Cambridge (1998)
7. Lassen, S.B.: Relational Reasoning about Functions and Nondeterminism. PhD thesis, Department of Computer Science, University of Aarhus (1998)
8. Jeffrey, A., Rathke, J.: Towards a theory of bisimulation for local names. In: 14th Annual IEEE Symposium on Logic in Computer Science, pp. 56-66. IEEE Computer Society Press, Los Alamitos (1999)
9. Sumii, E., Pierce, B.C.: A bisimulation for type abstraction and recursion. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 63-74. ACM Press, New York (2005)
10. Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation 124(2), 103-112 (1996)
11. Ferreira, W., Hennessy, M., Jeffrey, A.: A theory of weak bisimulation for core CML. Journal of Functional Programming 8(5), 447-491 (1998)
12. Godskesen, J.C., Hildebrandt, T.: Extending Howe's method to early bisimulations for typed mobile embedded resources with local names. In: Ramanujam, R., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 140-151. Springer, Heidelberg (2005)
13. Koutavas, V., Wand, M.: Small bisimulations for reasoning about higher-order imperative programs. In: Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 141-152. ACM Press, New York (2006)
14. Mitchell, J.C.: Foundations for Programming Languages. MIT Press, Cambridge (1996)
15. Pitts, A.: Typed operational reasoning. In: Pierce, B.C. (ed.) Advanced Topics in Types and Programming Languages, pp. 245-289. MIT Press, Cambridge (2005)
16. Birkedal, L., Harper, R.: Relational interpretations of recursive types in an operational setting. Information and Computation 155(1-2), 3-63 (1999) Summary appeared in TACS 1997, LNCS, vol. 1281, pp. 458-490. Springer, Heidelberg (1997)
17. Crary, K., Harper, R.: Syntactic logical relations for polymorphic and recursive types. In: Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin. ENTCS, vol. 172, pp. 259-299. Elsevier Science, Amsterdam (2007)
18. Appel, A.W., McAllester, D.: An indexed model of recursive types for foundational proof-carrying code. ACM Transactions on Programming Languages and Systems 23(5), 657-683 (2001)
19. Ahmed, A.: Step-indexed syntactic logical relations for recursive and quantified types. In: 15th European Symposium on Programming, pp. 69-83 (2006)
20. Ahmed, A., Appel, A.W., Virga, R.: An indexed model of impredicative polymorphism and mutable references (2003), http://www.cs.princeton.edu/~amal/ papers/impred.pdf
21. Sumii, E., Pierce, B.C.: Logical relations for encryption. Journal of Computer Security 11(4), 521-554 (2003) (extended abstract appeared) In: 14th IEEE Computer Security Foundations Workshop, pp. 256-269 (2001)
22. Sumii, E., Pierce, B.C.: A bisimulation for dynamic sealing. Theoretical Computer Science 375(1-3), 169-192 (2007) (extended abstract appeared) In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 161-172 (2004)
23. Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higherorder languages. In: 22nd Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos (2007)
24. Sangiorgi, D.: On the origins of bisimulation, coinduction, and fixed points. Draft (May 2007)
25. Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
26. Lassen, S.B.: Relational reasoning about contexts. In: Gordon, A.D., Pitts, A.M. (eds.) Higher Order Operational Techniques in Semantics. Publications of the Newton Institute, pp. 91-135. Cambridge University Press, Cambridge (1998)
27. Boreale, M., Sangiorgi, D.: Bisimulation in name-passing calculi without matching. In: 13th Annual IEEE Symposium on Logic in Computer Science, pp. 165-175. IEEE Computer Society Press, Los Alamitos (1998)
28. Pierce, B.C., Sangiorgi, D.: Behavioral equivalence in the polymorphic pi-calculus. Journal of the ACM 47(3), 531-586 (2000) (extended abstract appeared) In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 531-584 (1997)
29. Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. SIAM Journal on Computing 31(3), 947-986(2002) (preliminary version appeared) In: 14th Annual IEEE Symposium on Logic in Computer Science, pp. 157-166 (1999)