Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Paul Blain Levy
2010 – today
- 2013
[c11]Sam Staton, Paul Blain Levy: Universal properties of impure programming languages. POPL 2013: 179-192
[i1]Nathan Bowler, Sergey Goncharov, Paul Blain Levy, Lutz Schröder: Exploring the Boundaries of Monad Tensorability on Set. CoRR abs/1309.2128 (2013)- 2012
[j13]Luca Aceto, Anna Ingólfsdóttir, Paul Blain Levy, Joshua Sack: Characteristic formulae for fixed-point semantics: a general framework. Mathematical Structures in Computer Science 22(2): 125-173 (2012)
[c10]Roly Perera, Umut A. Acar, James Cheney, Paul Blain Levy: Functional programs that explain their work. ICFP 2012: 365-376
[c9]Jirí Adámek, Stefan Milius, Nathan Bowler, Paul Blain Levy: Coproducts of Monads on Set. LICS 2012: 45-54
[e1]James Chapman, Paul Blain Levy (Eds.): Proceedings Fourth Workshop on Mathematically Structured Functional Programming. EPTCS 76, 2012- 2011
[j12]Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii: From Applicative to Environmental Bisimulation. Electr. Notes Theor. Comput. Sci. 276: 215-235 (2011)
[c8]- 2010
[c7]
2000 – 2009
- 2009
[j11]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
[j10]
[j9]Paul Blain Levy: Global State Considered Helpful. Electr. Notes Theor. Comput. Sci. 218: 241-259 (2008)
[c6]Søren B. Lassen, Paul Blain Levy: Typed Normal Form Bisimulation for Parametric Polymorphism. LICS 2008: 341-352- 2007
[j8]Paul Blain Levy: Amb Breaks Well-Pointedness, Ground Amb Doesn't. Electr. Notes Theor. Comput. Sci. 173: 221-239 (2007)
[j7]Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power: Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1-3): 20-40 (2007)
[c5]- 2006
[j6]
[j5]Paul Blain Levy: Monads and Adjunctions for Global Exceptions. Electr. Notes Theor. Comput. Sci. 158: 261-287 (2006)
[j4]
[j3]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)
[c4]- 2005
[c3]- 2004
[b1]Paul Blain Levy: Call-By-Push-Value: A Functional/Imperative Synthesis. Semantics Structures in Computation 2, Springer 2004, ISBN 1-4020-1730-8- 2003
[j2]Paul Blain Levy, John Power, Hayo Thielecke: Modelling environments in call-by-value programming languages. Inf. Comput. 185(2): 182-210 (2003)- 2002
[j1]Paul Blain Levy: Adjunction Models For Call-By-Push-Value With Stacks. Electr. Notes Theor. Comput. Sci. 69: 248-271 (2002)
[c2]
1990 – 1999
- 1999
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17 21:25 CEST by the dblp team



