| A concrete framework for environment machines M Biernacka, O Danvy ACM Transactions on Computational Logic (TOCL) 9 (1), 6-es, 2007 | 92 | 2007 |
| An operational foundation for delimited continuations in the CPS hierarchy M Biernacka, D Biernacki, O Danvy Logical Methods in Computer Science 1, 2005 | 80 | 2005 |
| A syntactic correspondence between context-sensitive calculi and abstract machines M Biernacka, O Danvy Theoretical Computer Science 375 (1-3), 76-108, 2007 | 66 | 2007 |
| 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 |
| A derivational approach to the operational semantics of functional languages M lgorzata Biernacka PhD thesis, BRICS PhD School, Department of Computer Science, Aarhus …, 2006 | 23 | 2006 |
| Towards compatible and interderivable semantic specifications for the Scheme programming language, Part II: Reduction semantics and abstract machines M Biernacka, O Danvy Semantics and Algebraic Specification: Essays dedicated to Peter D. Mosses …, 2009 | 21 | 2009 |
| Generalized refocusing: From hybrid strategies to abstract machines M Biernacka, W Charatonik, K Zielinska 2nd International Conference on Formal Structures for Computation and …, 2017 | 19 | 2017 |
| 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 |
| 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 |
| Program extraction from proofs of weak head normalization M Biernacka, O Danvy, K Støvring Electronic Notes in Theoretical Computer Science 155, 169-189, 2006 | 15 | 2006 |
| Deriving an abstract machine for strong call by need M Biernacka, W Charatonik 4th International Conference on Formal Structures for Computation and …, 2019 | 14 | 2019 |
| An operational foundation for delimited continuations M Biernacka, D Biernacki, O Danvy BRICS Report Series, 2003 | 14 | 2003 |
| A derived reasonable abstract machine for strong call by value M Biernacka, W Charatonik, T Drab Proceedings of the 23rd International Symposium on Principles and Practice …, 2021 | 11 | 2021 |
| An operational foundation for the tactic language of Coq W Jedynak, M Biernacka, D Biernacki Proceedings of the 15th Symposium on Principles and Practice of Declarative …, 2013 | 11 | 2013 |
| A context-based approach to proving termination of evaluation M Biernacka, D Biernacki Electronic Notes in Theoretical Computer Science 249, 169-192, 2009 | 11 | 2009 |
| Formalizing constructions of abstract machines for functional languages in Coq M lgorzata Biernacka, D Biernacki WRS’07, 84, 2007 | 11 | 2007 |
| Typing control operators in the CPS hierarchy M Biernacka, D Biernacki, S Lenglet Proceedings of the 13th international ACM SIGPLAN symposium on Principles …, 2011 | 9 | 2011 |
| Fully Abstract Encodings of -Calculus in HOcore through Abstract Machines M Biernacka, D Biernacki, S Lenglet, P Polesiuk, D Pous, A Schmitt Logical Methods in Computer Science 20, 2024 | 6 | 2024 |
| The zoo of lambda-calculus reduction strategies, and Coq M Biernacka, W Charatonik, T Drab 13th International Conference on Interactive Theorem Proving (ITP 2022), 2022 | 6 | 2022 |
| A simple and efficient implementation of strong call by need by an abstract machine M Biernacka, W Charatonik, T Drab Proceedings of the ACM on Programming Languages 6 (ICFP), 109-136, 2022 | 5 | 2022 |
