 | 2009 |
| 18 |  | Paul Blain Levy,
Kidane Yemane Weldemariam:
Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity.
Electr. Notes Theor. Comput. Sci. 249: 357-375 (2009) |
| 2008 |
| 17 |  | Søren B. Lassen,
Paul Blain Levy:
Typed Normal Form Bisimulation for Parametric Polymorphism.
LICS 2008: 341-352 |
| 16 |  | Paul Blain Levy:
Infinite trace equivalence.
Ann. Pure Appl. Logic 151(2-3): 170-198 (2008) |
| 15 |  | Paul Blain Levy:
Global State Considered Helpful.
Electr. Notes Theor. Comput. Sci. 218: 241-259 (2008) |
| 2007 |
| 14 |  | Søren B. Lassen,
Paul Blain Levy:
Typed Normal Form Bisimulation.
CSL 2007: 283-297 |
| 13 |  | Paul Blain Levy:
Amb Breaks Well-Pointedness, Ground Amb Doesn't.
Electr. Notes Theor. Comput. Sci. 173: 221-239 (2007) |
| 12 |  | Martin Hyland,
Paul Blain Levy,
Gordon D. Plotkin,
John Power:
Combining algebraic effects with continuations.
Theor. Comput. Sci. 375(1-3): 20-40 (2007) |
| 2006 |
| 11 |  | Paul Blain Levy:
Jumbo lambda-Calculus.
ICALP (2) 2006: 444-455 |
| 10 |  | Paul Blain Levy:
Infinite Trace Equivalence.
Electr. Notes Theor. Comput. Sci. 155: 467-496 (2006) |
| 9 |  | Paul Blain Levy:
Monads and Adjunctions for Global Exceptions.
Electr. Notes Theor. Comput. Sci. 158: 261-287 (2006) |
| 8 |  | Paul Blain Levy:
Infinitary Howe's Method.
Electr. Notes Theor. Comput. Sci. 164(1): 85-104 (2006) |
| 7 |  | Paul Blain Levy:
Call-by-push-value: Decomposing call-by-value and call-by-name.
Higher-Order and Symbolic Computation 19(4): 377-414 (2006) |
| 2005 |
| 6 |  | Paul Blain Levy:
Infinite trace equivalence.
GALOP 2005: 195-209 |
| 2004 |
| 5 |  | Paul Blain Levy:
Call-By-Push-Value: A Functional/Imperative Synthesis
Springer 2004 |
| 2003 |
| 4 |  | Paul Blain Levy,
John Power,
Hayo Thielecke:
Modelling environments in call-by-value programming languages.
Inf. Comput. 185(2): 182-210 (2003) |
| 2002 |
| 3 |  | Paul Blain Levy:
Possible World Semantics for General Storage in Call-By-Value.
CSL 2002: 232-246 |
| 2 |  | Paul Blain Levy:
Adjunction Models For Call-By-Push-Value With Stacks.
Electr. Notes Theor. Comput. Sci. 69: (2002) |
| 1999 |
| 1 |  | Paul Blain Levy:
Call-by-Push-Value: A Subsuming Paradigm.
TLCA 1999: 228-242 |