|
38
|
Small bisimulations for reasoning about higher-order imperative programs
– V Koutavas, M Wand
- 2006
|
|
37
|
A bisimulation for type abstraction and recursion
– Eijiro Sumii, Benjamin C. Pierce
- 2005
|
|
101
|
Operational Reasoning for Functions With Local State
– Andrew Pitts, Ian Stark
|
|
2972
|
Communication and Concurrency
– R Milner
- 1989
|
|
367
|
The ⇡-calculus: A Theory of Mobile Processes
– Davide Sangiorgi, David Walker
- 2001
|
|
44
|
State-dependent representation independence
– Amal Ahmed, Derek Dreyer, Andreas Rossberg
- 2009
|
|
14
|
A Complete Characterization of Observational Equivalence in Polymorphic λ-Calculus with General References
– Eijiro Sumii
- 2009
|
|
29
|
A bisimulation for dynamic sealing
– Eijiro Sumii
- 2004
|
|
11
|
A complete, co-inductive syntactic theory of sequential control and state
– K Støvring, S Lassen
- 2007
|
|
9
|
Normal form bisimulation for parametric polymorphism
– Soren B. Lassen, Google Inc, Paul Blain Levy
- 2008
|
|
114
|
An Indexed Model of Recursive Types for Foundational Proof-Carrying Code
– Andrew W. Appel, David Mcallester
- 2000
|
|
102
|
Proving congruence of bisimulation in functional programming languages
– Douglas J. Howe
- 1996
|
|
60
|
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
– Amal Ahmed
- 2006
|
|
108
|
Equivalence in Functional Languages with Effects
– Ian Mason, Carolyn Talcott
- 1991
|
|
9
|
A fully abstract trace semantics for general references
– J. Laird
- 2007
|
|
18
|
Contextual equivalence for higher-order pi-calculus revisited
– A Jeffrey, J Rathke
|
|
22
|
The impact of higher-order state and control effects on local relational reasoning (Technical appendix
– Derek Dreyer, Georg Neis, Lars Birkedal
- 2010
|
|
121
|
Lambda-Calculus Models of Programming Languages
– J H Morris
- 1968
|
|
14
|
Bisimulations for untyped imperative objects
– V Koutavas, M Wand
|
