| Handle with care: relational interpretation of algebraic effects and handlers D Biernacki, M Piróg, P Polesiuk, F Sieczkowski Proceedings of the ACM on Programming Languages 2 (POPL), 1-30, 2017 | 73* | 2017 |
| Binders by day, labels by night: effect instances via lexically scoped handlers D Biernacki, M Piróg, P Polesiuk, F Sieczkowski Proceedings of the ACM on Programming Languages 4 (POPL), 1-29, 2019 | 60 | 2019 |
| Abstracting algebraic effects D Biernacki, M Piróg, P Polesiuk, F Sieczkowski Proceedings of the ACM on Programming Languages 3 (POPL), 1-28, 2019 | 56 | 2019 |
| The coinductive resumption monad M Piróg, J Gibbons Electronic notes in theoretical computer science 308, 273-288, 2014 | 53 | 2014 |
| Syntax and semantics for operations with scopes M Piróg, T Schrijvers, N Wu, M Jaskelioff Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018 | 50 | 2018 |
| Monad transformers and modular algebraic effects: what binds them together T Schrijvers, M Piróg, N Wu, M Jaskelioff Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 98-113, 2019 | 48 | 2019 |
| Typed equivalence of effect handlers and delimited control M Piróg, P Polesiuk, F Sieczkowski 4th International Conference on Formal Structures for Computation and …, 2019 | 39 | 2019 |
| A systematic derivation of the STG machine verified in Coq M Piróg, D Biernacki ACM Sigplan Notices 45 (11), 25-36, 2010 | 31 | 2010 |
| Unifying guarded and unguarded iteration S Goncharov, L Schröder, C Rauch, M Piróg Foundations of Software Science and Computation Structures: 20th …, 2017 | 25 | 2017 |
| Backtracking with cut via a distributive law and left-zero monoids M Piróg, S Staton Journal of Functional Programming 27, e17, 2017 | 20 | 2017 |
| Tracing monadic computations and representing effects M Piróg, J Gibbons arXiv preprint arXiv:1202.2922, 2012 | 16 | 2012 |
| High-level effect handlers in C++ D Ghica, S Lindley, MM Bravo, M Piróg Proceedings of the ACM on Programming Languages 6 (OOPSLA2), 1639-1667, 2022 | 14 | 2022 |
| Monads for behaviour M Piróg, J Gibbons Electronic Notes in Theoretical Computer Science 298, 309 − 324, 2013 | 14 | 2013 |
| Eilenberg-Moore Monoids and Backtracking Monad Transformers M Piróg arXiv preprint arXiv:1604.01184, 2016 | 12 | 2016 |
| Tabling with sound answer subsumption A Vandenbroucke, M Piróg, B Desouter, T Schrijvers Theory and Practice of Logic Programming 16 (5-6), 933-949, 2016 | 10 | 2016 |
| String diagrams for free monads (functional pearl) M Piróg, N Wu Proceedings of the 21st ACM SIGPLAN International Conference on Functional …, 2016 | 8 | 2016 |
| Modules over monads and their algebras M Piróg, N Wu, J Gibbons 6th International Conference on Algebra and Coalgebra in Computer Science …, 2015 | 7 | 2015 |
| Guarded and unguarded iteration for generalized processes S Goncharov, L Schröder, C Rauch, M Piróg Logical Methods in Computer Science 15, 2019 | 3 | 2019 |
| Degrading lists D McDermott, M Piróg, T Uustalu Proceedings of the 22nd International Symposium on Principles and Practice …, 2020 | 2 | 2020 |
| Equational theories and monads from polynomial Cayley representations M Piróg, P Polesiuk, F Sieczkowski International Conference on Foundations of Software Science and Computation …, 2019 | 2 | 2019 |
Jeremy GibbonsProfessor of Computing, University of OxfordVerified email at cs.ox.ac.uk
