A bisimulation for type abstraction and recursion (2005)

by Eijiro Sumii , Benjamin C. Pierce
Venue:SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES
Citations:46 - 4 self

Documents Related by Co-Citation

46 Small bisimulations for reasoning about higher-order imperative programs – Vasileios Koutavas, Mitchell Wand - 2006
365 Types, abstraction and parametric polymorphism – J C Reynolds - 1983
136 An Indexed Model of Recursive Types for Foundational Proof-Carrying Code – Andrew W. Appel, David Mcallester - 2000
73 Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types – Amal Ahmed - 2006
63 State-dependent representation independence – Amal Ahmed, Derek Dreyer, Andreas Rossberg - 2009
37 Typed operational reasoning – Andrew Pitts - 2004
111 Operational Reasoning for Functions With Local State – Andrew Pitts, Ian Stark
16 A complete, co-inductive syntactic theory of sequential control and state – K Støvring, S Lassen - 2007
42 A bisimulation for dynamic sealing – Eijiro Sumii - 2004
35 Environmental bisimulations for higher-order languages – Davide Sangiorgi - 2007
10 Normal form bisimulation for parametric polymorphism – Soren B. Lassen, Google Inc, Paul Blain Levy - 2008
27 Syntactic logical relations for polymorphic and recursive types – Karl Crary, Robert Harper
16 A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References – Eijiro Sumii - 2009
326 Theorems for free! – Philip Wadler - 1989
17 Bisimulations for Untyped Imperative Objects – V Koutavas, M Wand - 2006
130 Lambda-Calculus Models of Programming Languages – J H Morris - 1968
239 The Lazy Lambda Calculus – Samson Abramsky - 1990
54 Behavioral Equivalence in the Polymorphic Pi-Calculus – Benjamin C. Pierce, Davide Sangiorgi - 1997
14 Eager normal form bisimulation – Soren B. Lassen, Paul Blain Levy - 2005