Paul Blain Levy

Orcid: 0000-0003-0864-1876

Affiliations:
  • University of Birmingham, UK


According to our database1, Paul Blain Levy authored at least 42 papers between 1999 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Call-by-push-value.
ACM SIGLOG News, 2022

2021
Steps and traces.
J. Log. Comput., 2021

2019
Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot.
Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science, 2019

2018
A Ghost at ω<sub>1</sub>.
Log. Methods Comput. Sci., 2018

Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

A Syntactic View of Computational Adequacy.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

2017
Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version).
CoRR, 2017

Contextual isomorphisms.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Effectful applicative bisimilarity: Monads, relators, and Howe's method.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

A monad for full ground reference cells.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Iteration and Labelled Iteration.
Proceedings of the Thirty-second Conference on the Mathematical Foundations of Programming Semantics, 2016

A Ghost at $ω_1$.
CoRR, 2016

2015
On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday.
Appl. Categorical Struct., 2015

Final Coalgebras from Corecursive Algebras.
Proceedings of the 6th Conference on Algebra and Coalgebra in Computer Science, 2015

2014
Transition systems over games.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Exploring the Boundaries of Monad Tensorability on Set.
Log. Methods Comput. Sci., 2013

Universal properties of impure programming languages.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

2012
Characteristic formulae for fixed-point semantics: a general framework.
Math. Struct. Comput. Sci., 2012

Coproducts of Monads on Set.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Functional programs that explain their work.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
From Applicative to Environmental Bisimulation.
Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

Similarity Quotients as Final Coalgebras.
Proceedings of the Foundations of Software Science and Computational Structures, 2011

2010
Characterizing Recursive Programs up to Bisimilarity.
Proceedings of the 7th Workshop on Fixed Points in Computer Science, 2010

Limitations of Applicative Bisimulation (Preliminary Report).
Proceedings of the Modelling, Controlling and Reasoning About State, 29.08. - 03.09.2010, 2010

Higher-Order Containers.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

2008
Global State Considered Helpful.
Proceedings of the 24th Conference on the Mathematical Foundations of Programming Semantics, 2008

Typed Normal Form Bisimulation for Parametric Polymorphism.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007
Combining algebraic effects with continuations.
Theor. Comput. Sci., 2007

Amb Breaks Well-Pointedness, Ground Amb Doesn't.
Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

Typed Normal Form Bisimulation.
Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2006
Call-by-push-value: Decomposing call-by-value and call-by-name.
High. Order Symb. Comput., 2006

Infinitary Howe's Method.
Proceedings of the Eighth Workshop on Coalgebraic Methods in Computer Science, 2006

Monads and Adjunctions for Global Exceptions.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

Jumbo <i>lambda</i>-Calculus.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Infinite Trace Equivalence.
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, 2005

2004
Call-By-Push-Value: A Functional/Imperative Synthesis
Semantics Structures in Computation 2, Springer, ISBN: 1-4020-1730-8, 2004

2003
Modelling environments in call-by-value programming languages.
Inf. Comput., 2003

2002
Adjunction Models For Call-By-Push-Value With Stacks.
Proceedings of the Category Theory and Computer Science, 2002

Possible World Semantics for General Storage in Call-By-Value.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001
Call-by-push-value.
PhD thesis, 2001

1999
Call-by-Push-Value: A Subsuming Paradigm.
Proceedings of the Typed Lambda Calculi and Applications, 4th International Conference, 1999


  Loading...