Call-By-Push-Value: A Subsuming Paradigm (1999)

Cached

Download Links

by Paul Blain Levy
Venue:in Proc. TLCA ’99
Citations:15 - 0 self

Active Bibliography

32 A Semantic analysis of control – James David Laird - 1998
6 A game semantics of Idealized CSP – J. Laird - 2001
2 Full abstraction for Reduced ML – Andrzej S. Murawski, Nikos Tzevelekos - 2009
15 The Formal Relationship Between Direct and Continuation-Passing Style Optimizing Compilers: A Synthesis of Two Paradigms – Amr A. Sabry - 1994
18 A game semantics of local names and good variables – J. Laird - 2004
10 Adjunction models for call-by-push-value with stacks – Paul Blain Levy - 2005
31 Games and full abstraction for nondeterministic languages – Russell S. Harmer - 1999
47 Algorithmic Game Semantics – Samson Abramsky - 2001
11 A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations – Dariusz Biernacki, Olivier Danvy, Kevin Millikin - 2006
14 A Monadic Framework for Delimited Continuations – R. Kent Dybvig, Simon Peyton Jones, Amr Sabry
7 Continuation Semantics and Self-adjointness – Hayo Thielecke - 1997
13 A Relational Account of Call-by-Value Sequentiality – Anders B. Sandholm, Jon G. Riecke - 1999
A Fully Game Semantics for General References – Samson Abramsky, Kohei Honda, Guy Mccusker - 1998
12 Full abstraction for nominal general references – Nikos Tzevelekos
19 Isolating Side Effects in Sequential Languages – Jon G. Riecke, Ramesh Viswanathan - 1995
11 Axioms for Recursion in Call-by-Value – Masahito Hasegawa, Yoshihiko Kakutani - 2001
15 Advanced Languages for Systems Software The Fox Project in 1994 – Robert Harper, Peter Lee - 1994
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