Paul Blain Levy

55 papers A* 7A 1B 15C 1Journal 18Unranked 9

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	What Is a Monoid? Proc. ACM Program. Lang. Paul Blain Levy, Morgan Rogers
2025	A*	`conf`	Probabilistic Strategies: Definability and the Tensor Completeness Problem. LICS Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy
2025	J	`jnl`	Probabilistic Strategies: Definability and the Tensor Completeness Problem. CoRR Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy
2025	J	`jnl`	What is a monoid? CoRR Paul Blain Levy, Morgan Rogers
2023	B	`ed.`	Proceedings of the 39th Conference on the Mathematical Foundations of Programming Semantics, MFPS XXXIX, Indiana University, Bloomington, IN, USA, June 21-23, 2023 MFPS Marie Kerjean, Paul Blain Levy
2022	J	`jnl`	Call-by-push-value. ACM SIGLOG News Paul Blain Levy
2021	J	`jnl`	Steps and traces. J. Log. Comput. Jurriaan Rot, Bart Jacobs, Paul Blain Levy
2020	J	`jnl`	Steps and Traces. CoRR Jurriaan Rot, Bart Jacobs, Paul Blain Levy
2019	B	`conf`	Coinductive Resumption Monads: Guarded Iterative and Guarded Elgot. CALCO Paul Blain Levy, Sergey Goncharov
2018	J	`jnl`	A Ghost at ω Log. Methods Comput. Sci. Paul Blain Levy
2018	B	`conf`	A Syntactic View of Computational Adequacy. FoSSaCS Marco Devesas Campos, Paul Blain Levy
2018	B	`conf`	Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies. MFPS Nathan J. Bowler, Paul Blain Levy, Gordon D. Plotkin
2018	—	`conf`	Steps and Traces. CMCS Bart Jacobs, Paul Blain Levy, Jurriaan Rot
2017	A*	`conf`	A monad for full ground reference cells. LICS Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton
2017	J	`jnl`	A monad for full ground reference cells. CoRR Ohad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton
2017	A*	`conf`	Contextual isomorphisms. POPL Paul Blain Levy
2017	J	`jnl`	Effectful Applicative Bisimilarity: Monads, Relators, and Howe's Method (Long Version). CoRR Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy
2017	A*	`conf`	Effectful applicative bisimilarity: Monads, relators, and Howe's method. LICS Ugo Dal Lago, Francesco Gavazzo, Paul Blain Levy
2016	J	`jnl`	A Ghost at $ω_1$. CoRR Paul Blain Levy
2016	B	`conf`	Iteration and Labelled Iteration. MFPS Bram Geron, Paul Blain Levy
2015	B	`conf`	Final Coalgebras from Corecursive Algebras. CALCO Paul Blain Levy
2015	J	`jnl`	On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. Appl. Categorical Struct. Jirí Adámek, Paul Blain Levy, Stefan Milius, Lawrence S. Moss, Lurdes Sousa
2014	J	`jnl`	Coproducts of Monads on Set. CoRR Jirí Adámek, Nathan J. Bowler, Paul Blain Levy, Stefan Milius
2014	—	`ed.`	Proceedings 5th Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2014, Grenoble, France, 12 April 2014. MSFP@ETAPS Paul Blain Levy, Neel Krishnaswami
2014	—	`conf`	Transition systems over games. CSL-LICS Paul Blain Levy, Sam Staton
2013	J	`jnl`	Exploring the Boundaries of Monad Tensorability on Set. Log. Methods Comput. Sci. Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy, Lutz Schröder
2013	A*	`conf`	Universal properties of impure programming languages. POPL Sam Staton, Paul Blain Levy
2012	J	`jnl`	Characteristic formulae for fixed-point semantics: a general framework. Math. Struct. Comput. Sci. Luca Aceto, Anna Ingólfsdóttir, Paul Blain Levy, Joshua Sack
2012	A*	`conf`	Coproducts of Monads on Set. LICS Jirí Adámek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy
2012	A	`conf`	Functional programs that explain their work. ICFP Roly Perera, Umut A. Acar, James Cheney, Paul Blain Levy
2012	—	`ed.`	Proceedings Fourth Workshop on Mathematically Structured Functional Programming, MSFP@ETAPS 2012, Tallinn, Estonia, 25 March 2012. MSFP@ETAPS James Chapman, Paul Blain Levy
2011	B	`conf`	From Applicative to Environmental Bisimulation. MFPS Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii
2011	B	`conf`	Similarity Quotients as Final Coalgebras. FoSSaCS Paul Blain Levy
2010	—	`conf`	Characterizing Recursive Programs up to Bisimilarity. FICS Paul Blain Levy
2010	C	`conf`	Higher-Order Containers. CiE Thorsten Altenkirch, Paul Blain Levy, Sam Staton
2010	—	`conf`	Limitations of Applicative Bisimulation (Preliminary Report). Modelling, Controlling and Reasoning About State Vasileios Koutavas, Paul Blain Levy, Eijiro Sumii
2009	B	`conf`	Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity. MFPS Paul Blain Levy, Kidane Yemane Weldemariam
2008	B	`conf`	Global State Considered Helpful. MFPS Paul Blain Levy
2008	J	`jnl`	Infinite trace equivalence. Ann. Pure Appl. Log. Paul Blain Levy
2008	A*	`conf`	Typed Normal Form Bisimulation for Parametric Polymorphism. LICS Søren B. Lassen, Paul Blain Levy
2007	B	`conf`	Amb Breaks Well-Pointedness, Ground Amb Doesn't. MFPS Paul Blain Levy
2007	J	`jnl`	Combining algebraic effects with continuations. Theor. Comput. Sci. Martin Hyland, Paul Blain Levy, Gordon D. Plotkin, John Power
2007	B	`conf`	Typed Normal Form Bisimulation. CSL Søren B. Lassen, Paul Blain Levy
2006	J	`jnl`	Call-by-push-value: Decomposing call-by-value and call-by-name. High. Order Symb. Comput. Paul Blain Levy
2006	—	`conf`	Infinitary Howe's Method. CMCS Paul Blain Levy
2006	—	`conf`	Jumbo ICALP (2) Paul Blain Levy
2006	B	`conf`	Monads and Adjunctions for Global Exceptions. MFPS Paul Blain Levy
2005	B	`conf`	Infinite Trace Equivalence. MFPS Paul Blain Levy
2005	—	`conf`	Infinite trace equivalence. GALOP@ETAPS Paul Blain Levy
2004	—	`book`	Call-By-Push-Value: A Functional/Imperative Synthesis Paul Blain Levy
2003	J	`jnl`	Modelling environments in call-by-value programming languages. Inf. Comput. Paul Blain Levy, John Power, Hayo Thielecke
2002	—	`conf`	Adjunction Models For Call-By-Push-Value With Stacks. CTCS Paul Blain Levy
2002	B	`conf`	Possible World Semantics for General Storage in Call-By-Value. CSL Paul Blain Levy
2001	—	`—`	Call-by-push-value. Paul Blain Levy
1999	—	`conf`	Call-by-Push-Value: A Subsuming Paradigm. TLCA Paul Blain Levy