| A functional correspondence between evaluators and abstract machines MS Ager, D Biernacki, O Danvy, J Midtgaard Proceedings of the 5th ACM SIGPLAN international conference on Principles …, 2003 | 227 | 2003 |
| Clock-directed modular code generation for synchronous data-flow languages D Biernacki, JL Colaço, G Hamon, M Pouzet Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages …, 2008 | 153 | 2008 |
| An operational foundation for delimited continuations in the CPS hierarchy M Biernacka, D Biernacki, O Danvy Logical Methods in Computer Science 1, 2005 | 79 | 2005 |
| From interpreter to compiler and virtual machine: a functional derivation MS Ager, D Biernacki, O Danvy, J Midtgaard BRICS Report Series 10 (14), 2003 | 79 | 2003 |
| 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 | 61 | 2017 |
| Abstracting algebraic effects D Biernacki, M Piróg, P Polesiuk, F Sieczkowski Proceedings of the ACM on Programming Languages 3 (POPL), 1-28, 2019 | 55 | 2019 |
| 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 | 53 | 2019 |
| Subtyping delimited continuations M Materzok, D Biernacki ACM SIGPLAN Notices 46 (9), 81-93, 2011 | 39 | 2011 |
| From interpreter to logic engine by defunctionalization D Biernacki, O Danvy International Symposium on Logic-Based Program Synthesis and Transformation …, 2003 | 39 | 2003 |
| On the static and dynamic extents of delimited continuations D Biernacki, O Danvy, C Shan Science of Computer Programming 60 (3), 274-297, 2006 | 38 | 2006 |
| A dynamic interpretation of the CPS hierarchy M Materzok, D Biernacki Programming Languages and Systems: 10th Asian Symposium, APLAS 2012, Kyoto …, 2012 | 33 | 2012 |
| A systematic derivation of the STG machine verified in Coq M Piróg, D Biernacki ACM Sigplan Notices 45 (11), 25-36, 2010 | 33 | 2010 |
| A dynamic continuation-passing style for dynamic delimited continuations D Biernacki, O Danvy, K Millikin BRICS, Department of Computer Science, Univ., 2005 | 29 | 2005 |
| Automating derivations of abstract machines from reduction semantics: A generic formalization of refocusing in Coq F Sieczkowski, M Biernacka, D Biernacki Implementation and Application of Functional Languages: 22nd International …, 2011 | 26 | 2011 |
| THEORETICAL PEARL: A simple proof of a folklore theorem about delimited control D Biernacki, O Danvy Journal of Functional Programming 16 (3), 269-280, 2006 | 22 | 2006 |
| The theory and practice of programming languages with delimited continuations D Biernacki PhD thesis, BRICS PhD School, University of Aarhus, Aarhus, Denmark, 2005 | 20 | 2005 |
| Context-based proofs of termination for typed delimited-control operators M Biernacka, D Biernacki Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of …, 2009 | 18 | 2009 |
| Logical relations for coherence of effect subtyping D Biernacki, P Polesiuk Logical methods in computer science 14, 2018 | 17 | 2018 |
| A Coq formalization of normalization by evaluation for Martin-Löf type theory P Wieczorek, D Biernacki Proceedings of the 7th ACM SIGPLAN International Conference on Certified …, 2018 | 17 | 2018 |
| An abstract machine for strong call by value M Biernacka, D Biernacki, W Charatonik, T Drab Asian Symposium on Programming Languages and Systems, 147-166, 2020 | 16 | 2020 |
