Call-by-push-value: A Functional/imperative Synthesis PB Levy Springer Science & Business Media, 2012 | 439* | 2012 |
Modelling environments in call-by-value programming languages PB Levy, J Power, H Thielecke Information and computation 185 (2), 182-210, 2003 | 199 | 2003 |
Call-by-push-value PB Levy | 113 | 2013 |
Combining algebraic effects with continuations M Hyland, PB Levy, G Plotkin, J Power Theoretical Computer Science 375 (1), 20-40, 2007 | 79* | 2007 |
Effectful applicative bisimilarity: Monads, relators, and Howe's method U Dal Lago, F Gavazzo, PB Levy 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 69 | 2017 |
Thoracoscopic laser bullectomy: a prospective study with three-month results S Hazelrigg, T Boley, J Henkle, C Lawyer, D Johnstone, K Naunheim, ... The Journal of Thoracic and Cardiovascular Surgery 112 (2), 319-327, 1996 | 67 | 1996 |
Functional programs that explain their work R Perera, UA Acar, J Cheney, PB Levy Proceedings of the 17th ACM SIGPLAN international conference on Functional …, 2012 | 65 | 2012 |
Possible world semantics for general storage in call-by-value PB Levy International Workshop on Computer Science Logic, 232-246, 2002 | 59 | 2002 |
Similarity quotients as final coalgebras P Levy Foundations of Software Science and Computational Structures, 27-41, 2011 | 57 | 2011 |
Typed normal form bisimulation S Lassen, P Levy Computer Science Logic, 283-297, 2007 | 57 | 2007 |
From applicative to environmental bisimulation V Koutavas, PB Levy, E Sumii Electronic Notes in Theoretical Computer Science 276, 215-235, 2011 | 52 | 2011 |
Adjunction models for call-by-push-value with stacks PB Levy Theory and Applications of Categories 14 (5), 75-110, 2005 | 51 | 2005 |
Typed normal form bisimulation for parametric polymorphism SB Lassen, PB Levy 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 341-352, 2008 | 45 | 2008 |
Infinite trace equivalence PB Levy Annals of Pure and Applied Logic 151 (2), 170-198, 2008 | 32* | 2008 |
Characteristic formulae for fixed-point semantics: a general framework L Aceto, A Ingólfsdóttir, PB Levy, J Sack Mathematical Structures in Computer Science 22 (2), 125-173, 2012 | 31 | 2012 |
Universal properties of impure programming languages S Staton, PB Levy ACM SIGPLAN Notices 48 (1), 179-192, 2013 | 30 | 2013 |
Monads and adjunctions for global exceptions PB Levy Electronic Notes in Theoretical Computer Science 158, 261-287, 2006 | 30 | 2006 |
Coproducts of monads on set J Ad'mek, S Milius, N Bowler, PB Levy 2012 27th Annual IEEE Symposium on Logic in Computer Science, 45-54, 2012 | 29 | 2012 |
A monad for full ground reference cells O Kammar, PB Levy, SK Moss, S Staton 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017 | 24 | 2017 |
Transition systems over games PB Levy, S Staton Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014 | 24 | 2014 |