Environmental bisimulations for higher-order languages

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 293-302

  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

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

BIOMINERALIZATION; CALCULATIONS; COMPUTATION THEORY; PATHOLOGY;

FAULT TOLERANCE;

EID: 82755165784     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.17     Document Type: Conference Paper

References (43)

1. M. Abadi and A. D. Gordon. A bisimulation method for cryptographic protocols. ESOP, 1998.
2. S. Abramsky. The lazy lambda calculus. Research Topics in Functional Programming, Addison-Wesley, 1990.
3. A. Ahmed. Step-indexed syntactic logical relations for recursive and quantified types. ESOP, 2006.
4. A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. TOPLAS, 23(5):657-683, 2001. (Pubitemid 33609124)
5. M. Baldamus and T. Frauenstein. Congruence proofs for weak bisimulation equivalences on higher-order process calculi, 1995. Rep. 95-21, Berlin University of Technology.
6. L. Birkedal and R. Harper. Relational interpretations of recursive types in an operational setting. Inf. and Comput., 155(1-2):3-63, 1999. (Pubitemid 129610453)
7. M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. LICS, 1998.
8. W. Ferreira, M. Hennessy, and A. Jeffrey. A theory of weak bisimulation for core CML. J. Functional Programming, 8(5):447-491, 1998. (Pubitemid 128542040)
9. J. Godskesen and T. Hildebrandt. Extending Howe's method to early bisimulations for typed mobile embedded resources with local names. FSTTCS, LNCS 3821, Springer, 2005.
10. A. D. Gordon. Functional Programming and Input/Output. PhD thesis, University of Cambridge, 1993.
11. K. Honda and N. Yoshida. On reduction-based process semantics. Theor. Comp. Sci., 152(2):437-486, 1995.
12. D. J. Howe. Proving congruence of bisimulation in functional programming languages. Inf. and Comput., 124(2):103-112, 1996. (Pubitemid 126412198)
13. A. Jeffrey and J. Rathke. Towards a theory of bisimulation for local names. LICS, 1999.
14. A. Jeffrey and J. Rathke. A theory of bisimulation for a fragment of concurrent ML with local names. Theor. Comput. Sci., 323(1-3):1-48, 2004.
15. A. Jeffrey and J. Rathke. Contextual equivalence for higherorder pi-calculus revisited. Logical Methods in Computer Science, 1(1:4):1-22, 2005.
16. V. Koutavas and M. Wand. Bisimulations for untyped imperative objects. ESOP, 2006.
17. V. Koutavas and M. Wand. Small bisimulations for reasoning about higher-order imperative programs. POPL, 2006.
18. S. B. Lassen. Relational reasoning about contexts. Higher Order Operational Techniques in Semantics, Cambridge University Press, 1998.
19. S. B. Lassen. Relational Reasoning about Functions and Nondeterminism. PhD thesis, Department of Computer Science, University of Aarhus, 1998.
20. M. Merro and M. Hennessy. Bisimulation congruences in Safe Ambients. POPL, 2002.
21. M. Merro and F. Z. Nardelli. Behavioral theory for mobile ambients. J. ACM, 52(6):961-1023, 2005. (Pubitemid 43906508)
22. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
23. R. Milner. Pure bigraphs: Structure and dynamics. Inf. and Comput., 204(1):60-122, 2006. (Pubitemid 41795789)
24. J. H. Morris, Jr. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, 1968.
25. L. Ong. The Lazy Lambda Calculus: an Investigation into the Foundations of Functional Programming. PhD thesis, University of London, 1988.
26. B. C. Pierce and D. Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. J. ACM, 47(3):531-586, 2000.
27. A. Pitts. Operationally-based theories of program equivalence. Semantics and Logics of Computation, Cambridge University Press, 1997.
28. A. Pitts. Typed operational reasoning. Advanced Topics in Types and Programming Languages, MIT Press, 2005.
29. J. C. Reynolds. Types, abstraction and parametric polymorphism. Information Processing, 1983.
30. D. Sands. Improvement theory and its applications. Higher Order Operational Techniques in Semantics, Cambridge University Press, 1998.
31. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigm. PhD thesis, University of Edinburgh, 1992.
32. D. Sangiorgi. The Lazy Lambda Calculus in a Concurrency Scenario. Inf. and Comput., 111(1):120-153, 1994.
33. D. Sangiorgi. Bisimulation for Higher-Order Process Calculi. Inf. and Comput., 131(2):141-178, 1996. (Pubitemid 126411078)
34. D. Sangiorgi, N. Kobayashi, and E. Sumii Appendixes to the paper "Environmental Bisimulations for Higher-Order Languages." http://www.cs.unibo.it/~sangio/DOC-public/appLICS07.pdf, 2007.
35. D. Sangiorgi, N. Kobayashi, and E. Sumii. Logical Bisimulations for Higher-Order Languages, Forthcoming, 2007.
36. D. Sangiorgi and R. Milner. The problem of "Weak Bisimulation up to". Proc. CONCUR, LNCS 630, Springer, 1992.
37. D. Sangiorgi and D. Walker. The π-calculus: a Theory of Mobile Processes. Cambridge University Press, 2001.
38. A. Schmitt and J.-B. Stefani. The Kell Calculus: A family of higher-order distributed process calculi. Global Computing, LNCS 3267, Springer, 2004.
39. K. Støvring and S. Lassen. A complete, co-inductive syntactic theory of sequential control and state. POPL, 2007.
40. E. Sumii and B. C. Pierce. Logical relations for encryption. J. Computer Security, 11(4):521-554, 2003.
41. E. Sumii and B. C. Pierce. A bisimulation for dynamic sealing. Theor. Comput. Sci., 375(1-3):169-192, 2007. (Pubitemid 46528650)
42. E. Sumii and B. C. Pierce. A bisimulation for type abstraction and recursion. POPL, 2005.
43. B. Thomsen. Plain CHOCS, a second generation calculus for higher-order processes. Acta Inf., 30:1-59, 1993.