|
31
|
A Semantic analysis of control
– James David Laird
- 1998
|
|
5
|
A game semantics of Idealized CSP
– J. Laird
- 2001
|
|
13
|
The Formal Relationship Between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms
– Amr A. Sabry
- 1994
|
|
14
|
A game semantics of local names and good variables
– J. Laird
- 2004
|
|
9
|
Adjunction models for call-by-push-value with stacks
– Paul Blain Levy
- 2005
|
|
23
|
Games and full abstraction for nondeterministic languages
– Russell S. Harmer
- 1999
|
|
44
|
Algorithmic Game Semantics
– Samson Abramsky
- 2001
|
|
10
|
A Monadic Framework for Delimited Continuations
– R. Kent Dybvig, Simon Peyton Jones, Amr Sabry
|
|
11
|
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations
– Dariusz Biernacki, Olivier Danvy, Kevin Millikin
- 2006
|
|
7
|
Continuation Semantics and Self-adjointness
– Hayo Thielecke
- 1997
|
|
|
A Fully Game Semantics for General References
– Samson Abramsky, Kohei Honda, Guy Mccusker
- 1998
|
|
13
|
A Relational Account of Call-by-Value Sequentiality
– Anders B. Sandholm, Jon G. Riecke
- 1999
|
|
17
|
Isolating Side Effects in Sequential Languages
– Jon G. Riecke, Ramesh Viswanathan
- 1995
|
|
9
|
Axioms for Recursion in Call-by-Value
– Masahito Hasegawa, Yoshihiko Kakutani
|
|
34
|
Compilation and Equivalence of Imperative Objects
– Andrew D. Gordon, Paul D. Hankin, Søren B. Lassen
- 1998
|
|
1
|
Theory for Software Verification
– David A. Naumann
- 2009
|
|
4
|
Games and Sequential Algorithms
– Jim Laird
- 2001
|
|
12
|
Eager normal form bisimulation
– Soren B. Lassen, Paul Blain Levy
- 2005
|
|
1
|
Relational Semantics for Higher-Order Functional Programs
– Kamal Aboul-Hosn, Dexter Kozen
|