Abstract

Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be: (1) the proof of congruence, as well as enhancements of the bisimulation proof method with “up-to context ” techniques, and (2) obtaining definitions and results that scale to languages with different features. To meet these challenges, we present environmental bisimulations, a form of bisimulation for higher-order languages, and its basic theory. We consider four representative calculi: pure λ-calculi (call-by-name and call-byvalue), call-by-value λ-calculus with higher-order store, and then Higher-Order π-calculus. In each case: we present the basic properties of environmental bisimilarity, including congruence; we show that it coincides with contextual equivalence; we develop some up-to techniques, including up-to context, as examples of possible enhancements of the associated bisimulation method. Unlike previous approaches (such as applicative bisimulations, logical relations, Sumii-Pierce-Koutavas-Wand), our method does not require induction/indices on evaluation derivation/steps (which may complicate the proofs of congruence, transitivity, and the combination with up-to techniques), or sophisticated methods such as Howe’s for proving congruence. It also scales from the pure λ-calculi to the richer calculi with simple congruence proofs. 1

Citations

2970	Communication and Concurrency - Milner - 1989
367	The ⇡-calculus: A Theory of Mobile Processes - Sangiorgi, Walker - 2001
332	Types, abstraction, and parametric polymorphism - Reynolds - 1983
238	Expressing Mobility in Process Algebras: First-Order and HigerOrder Paradigms - Sangiorgi - 1992
218	The lazy lambda calculus - Abramsky - 1990
123	On reduction-based process semantics - Honda, Tokoro - 1995
120	Lambda Calculus Models of Programming Languages - Morris - 1968
111	An indexed model of recursive types for foundational proofcarrying code - Appel, McAllester
102	Functional programming and input/output - Gordon - 1994
102	Proving congruence of bisimulation in functional programming languages - Howe - 1996
73	A bisimulation method for cryptographic protocols - Abadi, Gordon
73	Operationally-based theories of program equivalence - Pitts - 1997
58	Step-indexed syntactic logical relations for recursive and quantified types - Ahmed - 2006
51	Behavioral equivalence in the polymorphic pi-calculus - Pierce, Sangiorgi
50	The lazy lambda calculus in a concurrency scenario - Sangiorgi - 1994
48	Bisimulation for higher-order process calculi - Sangiorgi - 1996
47	The problem of “Weak Bisimulation up to - Sangiorgi, Milner - 1992
44	Plain CHOCS, a second generation calculus for higher-order processes - Thomsen - 1993
40	The Lazy Lambda Calculus: an Investigation into the Foundations of Functional Programming - Ong - 1988
39	Pure bigraphs: Structure and dynamics - Milner - 2006
38	A Theory of Weak Bisimulation for Core CML - Ferreira, Hennessy, et al. - 1995
38	Smaller bisimulations for reasoning about higher-order imperative programs - Koutavas, Wand - 2006
36	A bisimulation for type abstraction and recursion - Sumii, Pierce - 2005
33	Relational interpretations of recursive types in an operational setting - Birkedal, Harper - 1999
32	Logical relations for encryption - Sumii, Pierce - 2003
31	Relational Reasoning about Functions and Nondeterminism - Lassen - 1998
31	Typed operational reasoning - Pitts - 2005
28	A bisimulation for dynamic sealing - Sumii, Pierce - 2004
26	Bisimulation in name-passing calculi without matching, in - Boreale, Sangiorgi - 1998
26	The Kell Calculus: A Family of Higher-Order Distributed Process Calculi, in - Schmitt, Stefani
18	A theory of bisimulation for a fragment of Concurrent ML with local names - Jeffrey, Rathke
18	Contextual equivalence for higher-order pi-calculus revisited - Jeffrey, Rathke
12	F.: Behavioral theory for mobile ambients - Merro, Nardelli - 2005
11	A complete, co-inductive syntactic theory of sequential control and state - Støvring, Lassen - 2007
9	Extending howe’s method to early bisimulations for typed mobile embedded resources with local names - Godskesen, Hildebrandt - 2005
7	Congruence proofs for weak bisimulation equivalences on higher–order process calculi - Baldamus, Frauenstein - 1995
2	Relational Reasoning about Contexts. Higher Order - Lassen - 1998
1	Towards a theory of bisimulation for local names. LICS - Jeffrey, Rathke - 1999
1	Bisimulations for untyped imperative objects. ESOP - Koutavas, Wand - 2006
1	Bisimulation congruences - Merro, Hennessy - 2002
1	Improvement theory and its applications. Higher Order - Sands - 1998
1	Sumii Appendixes to the paper “Environmental Bisimulations for Higher-Order Languages.” http://www.cs.unibo.it/˜sangio/ DOC_public/appLICS07.pdf - Sangiorgi, Kobayashi, et al. - 2007