Environmental bisimulations for higher-order languages (2007)

by Davide Sangiorgi
Venue:In Twenty-Second Annual IEEE Symposium on Logic in Computer Science
Citations:33 - 10 self

Documents Related by Co-Citation

3204 Communication and Concurrency – R Milner - 1989
46 Small bisimulations for reasoning about higher-order imperative programs – Vasileios Koutavas, Mitchell Wand - 2006
434 The π-calculus: a Theory of Mobile Processes – D Sangiorgi, D Walker - 2001
110 Operational Reasoning for Functions With Local State – Andrew Pitts, Ian Stark
22 Contextual equivalence for higherorder pi-calculus revisited – A Jeffrey, J Rathke
46 A bisimulation for type abstraction and recursion – Eijiro Sumii, Benjamin C. Pierce - 2005
135 An Indexed Model of Recursive Types for Foundational Proof-Carrying Code – Andrew W. Appel, David Mcallester - 2000
16 A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References – Eijiro Sumii - 2009
16 A complete, co-inductive syntactic theory of sequential control and state – K Støvring, S Lassen - 2007
62 State-dependent representation independence – Amal Ahmed, Derek Dreyer, Andreas Rossberg - 2009
139 On reduction-based process semantics – Kohei Honda, Nobuko Yoshida - 1995
10 Normal form bisimulation for parametric polymorphism – Soren B. Lassen, Google Inc, Paul Blain Levy - 2008
37 Typed operational reasoning – Andrew Pitts - 2004
364 Types, abstraction and parametric polymorphism – J C Reynolds - 1983
42 A bisimulation for dynamic sealing – Eijiro Sumii - 2004
72 Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types – Amal Ahmed - 2006
106 Proving congruence of bisimulation in functional programming languages – Douglas J. Howe - 1996
11 A fully abstract trace semantics for general references – J. Laird - 2007
785 A calculus for cryptographic protocols: The spi calculus – Martin Abadi, Andrew D. Gordon - 1999