default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Blain Levy
Person information
- affiliation: University of Birmingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[e3]Marie Kerjean, Paul Blain Levy:
Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, MFPS XXXIX, Indiana University, Bloomington, IN, USA, June 21-23, 2023. EPTICS 3, EpiSciences 2023 [contents]- 2022
- [j10]Paul Blain Levy:
Call-by-push-value. ACM SIGLOG News 9(2): 7-29 (2022) - 2021
- [j9]Jurriaan Rot, Bart Jacobs, Paul Blain Levy:
Steps and traces. J. Log. Comput. 31(6): 1482-1525 (2021) - 2020
- [i6]Jurriaan Rot, Bart Jacobs, Paul Blain Levy:
Steps and Traces. CoRR abs/2004.05400 (2020)
2010 – 2019
- 2019
- [c30]Paul Blain Levy
, Sergey Goncharov:
Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot. CALCO 2019: 13:1-13:17 - 2018
- [j8]Paul Blain Levy:
A Ghost at ω1. Log. Methods Comput. Sci. 14(3) (2018) - [c29]Bart Jacobs, Paul Blain Levy, Jurriaan Rot:
Steps and Traces. CMCS 2018: 122-143 - [c28]Marco Devesas Campos, Paul Blain Levy:
A Syntactic View of Computational Adequacy. FoSSaCS 2018: 71-87 - [c27]Nathan J. Bowler, Paul Blain Levy, Gordon D. Plotkin:
Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies. MFPS 2018: 23-44 - 2017
- [c26]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. LICS 2017: 1-12 - [c25]Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy:
Effectful applicative bisimilarity: Monads, relators, and Howe's method. LICS 2017: 1-12 - [c24]Paul Blain Levy:
Contextual isomorphisms. POPL 2017: 400-414 - [i5]Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton:
A monad for full ground reference cells. CoRR abs/1702.04908 (2017) - [i4]Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy:
Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version). CoRR abs/1704.04647 (2017) - 2016
- [c23]Bram Geron, Paul Blain Levy:
Iteration and Labelled Iteration. MFPS 2016: 127-146 - [i3]Paul Blain Levy:
A Ghost at $ω_1$. CoRR abs/1612.09514 (2016) - 2015
- [j7]Jirí Adámek, Paul Blain Levy, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. Appl. Categorical Struct. 23(4): 609-641 (2015) - [c22]Paul Blain Levy:
Final Coalgebras from Corecursive Algebras. CALCO 2015: 221-237 - 2014
- [c21]Paul Blain Levy, Sam Staton:
Transition systems over games. CSL-LICS 2014: 64:1-64:10 - [e2]Paul Blain Levy, Neel Krishnaswami:
Proceedings 5th Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2014, Grenoble, France, 12 April 2014. EPTCS 153, 2014 [contents] - [i2]Jirí Adámek, Nathan J. Bowler, Paul Blain Levy, Stefan Milius:
Coproducts of Monads on Set. CoRR abs/1409.3804 (2014) - 2013
- [j6]Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy, Lutz Schröder:
Exploring the Boundaries of Monad Tensorability on Set. Log. Methods Comput. Sci. 9(3) (2013) - [c20]Sam Staton, Paul Blain Levy:
Universal properties of impure programming languages. POPL 2013: 179-192 - 2012
- [j5]Luca Aceto, Anna Ingólfsdóttir, Paul Blain Levy, Joshua Sack:
Characteristic formulae for fixed-point semantics: a general framework. Math. Struct. Comput. Sci. 22(2): 125-173 (2012) - [c19]Roly Perera, Umut A. Acar, James Cheney, Paul Blain Levy:
Functional programs that explain their work. ICFP 2012: 365-376 - [c18]Jirí Adámek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy:
Coproducts of Monads on Set. LICS 2012: 45-54 - [e1]James Chapman, Paul Blain Levy:
Proceedings Fourth Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2012, Tallinn, Estonia, 25 March 2012. EPTCS 76, 2012 [contents] - 2011
- [c17]Paul Blain Levy:
Similarity Quotients as Final Coalgebras. FoSSaCS 2011: 27-41 - [c16]Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii:
From Applicative to Environmental Bisimulation. MFPS 2011: 215-235 - 2010
- [c15]Thorsten Altenkirch, Paul Blain Levy, Sam Staton:
Higher-Order Containers. CiE 2010: 11-20 - [c14]Paul Blain Levy:
Characterizing Recursive Programs up to Bisimilarity. FICS 2010: 47-52 - [i1]Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii:
Limitations of Applicative Bisimulation (Preliminary Report). Modelling, Controlling and Reasoning About State 2010
2000 – 2009
- 2009
- [c13]Paul Blain Levy, Kidane Yemane Weldemariam:
Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity. MFPS 2009: 357-375 - 2008
- [j4]Paul Blain Levy:
Infinite trace equivalence. Ann. Pure Appl. Log. 151(2-3): 170-198 (2008) - [c12]Søren B. Lassen, Paul Blain Levy:
Typed Normal Form Bisimulation for Parametric Polymorphism. LICS 2008: 341-352 - [c11]Paul Blain Levy:
Global State Considered Helpful. MFPS 2008: 241-259 - 2007
- [j3]Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power:
Combining algebraic effects with continuations. Theor. Comput. Sci. 375(1-3): 20-40 (2007) - [c10]Søren B. Lassen, Paul Blain Levy:
Typed Normal Form Bisimulation. CSL 2007: 283-297 - [c9]Paul Blain Levy:
Amb Breaks Well-Pointedness, Ground Amb Doesn't. MFPS 2007: 221-239 - 2006
- [j2]Paul Blain Levy:
Call-by-push-value: Decomposing call-by-value and call-by-name. High. Order Symb. Comput. 19(4): 377-414 (2006) - [c8]Paul Blain Levy:
Jumbo lambda-Calculus. ICALP (2) 2006: 444-455 - [c7]Paul Blain Levy:
Infinitary Howe's Method. CMCS 2006: 85-104 - [c6]Paul Blain Levy:
Monads and Adjunctions for Global Exceptions. MFPS 2006: 261-287 - 2005
- [c5]Paul Blain Levy:
Infinite trace equivalence. GALOP@ETAPS 2005: 195-209 - [c4]Paul Blain Levy:
Infinite Trace Equivalence. MFPS 2005: 467-496 - 2004
- [b2]Paul Blain Levy:
Call-By-Push-Value: A Functional/Imperative Synthesis. Semantics Structures in Computation 2, Springer 2004, ISBN 1-4020-1730-8 - 2003
- [j1]Paul Blain Levy, John Power, Hayo Thielecke:
Modelling environments in call-by-value programming languages. Inf. Comput. 185(2): 182-210 (2003) - 2002
- [c3]Paul Blain Levy:
Possible World Semantics for General Storage in Call-By-Value. CSL 2002: 232-246 - [c2]Paul Blain Levy:
Adjunction Models For Call-By-Push-Value With Stacks. CTCS 2002: 248-271 - 2001
- [b1]Paul Blain Levy:
Call-by-push-value. Queen Mary University of London, UK, 2001
1990 – 1999
- 1999
- [c1]Paul Blain Levy:
Call-by-Push-Value: A Subsuming Paradigm. TLCA 1999: 228-242
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
