Levy, Paul Blain - School of Computer Science, University of Birmingham

• Combining continuations with other e ects Martin Hyland, 1 Paul Blain Levy, 2 Gordon Plotkin and John Power 3;?
• In nite Trace Semantics Paul Blain Levy
• CallByPushValue: A Subsuming Paradigm (extended abstract)
• Adjunction Semantics For Call-By-Push-Value Paul Blain Levy
• Divergence-Least Semantics Of amb Is Hoare Soren B. Lassen1
• Jumbo -Calculus Paul Blain Levy
• BOOLEAN PRECONGRUENCES PAUL BLAIN LEVY
• Typed Normal Form Bisimulation for Parametric Polymorphism Soren B. Lassen
• A tutorial on call-by-push-value Paul Blain Levy
• Jumping Semantics For Call-By-Push-Value Paul Blain Levy
• Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be
• Exploratory functions on nondeterministic strategies, up to lower bisimilarity
• Similarity Quotients as Final Coalgebras Paul Blain Levy
• Martin-Lof Clashes With Griffin, Operationally Paul Blain Levy
• Some parametricity isomorphisms Paul Blain Levy
• Modal properties of recursively defined commands Paul Blain Levy, University of Birmingham
• Amb breaks well-pointedness, ground amb doesn't
• Semantics of nondeterminism Paul Blain Levy
• Modal properties of recursive programs Work in progress
• Pointer game semantics for polymorphism (work in Soren Lassen1 Paul Blain Levy2
• CallByPushValue Paul Blain Levy
• Typed Normal Form Bisimulation Soren B. Lassen1
• Proceedings of the APPSEMII Workshop on the Krivine and ZINC Abstract Machines
• Similarity Quotients as Final Coalgebras Paul Blain Levy
• Call-By-Push-Value Paul Blain Levy
• Possible World Semantics for General Storage in Call-By-Value
• Global State Considered Helpful Paul Blain Levy 1
• Combining algebraic effects with continuations Martin Hyland,1
• CTCS 2002 Preliminary Version Adjunction Models For Call-By-Push-Value
• Noname manuscript No. (will be inserted by the editor)
• ADJUNCTION MODELS FOR CALL-BY-PUSH-VALUE WITH PAUL BLAIN LEVY
• Characterizing Recursive Programs Up To Bisimilarity Paul Blain Levy
• Modelling environments in call-by-value programming languages
• MFPS XX1 Preliminary Version Infinite Trace Equivalence
• Nondeterminism, fixpoints and bisimulation Paul Blain Levy
• Infinitary Howe's Method Paul Blain Levy 1
• Monads and Adjunctions for Global Exceptions Paul Blain Levy 1
• From Applicative to Environmental Bisimulation1