From Interpreter to Logic Engine by Defunctionalization. - Dariusz Biernacki; Olivier Danvy (LOPSTR, 2003)

A functional correspondence between evaluators and abstract machines. - Mads Sig Ager; Dariusz Biernacki; Olivier Danvy; Jan Midtgaard (PPDP, 2003)

On the dynamic extent of delimited continuations. - Dariusz Biernacki; Olivier Danvy; Chung-chieh Shan (Inf. Process. Lett., 2005)

An Operational Foundation for Delimited Continuations in the CPS Hierarchy. - Malgorzata Biernacka; Dariusz Biernacki; Olivier Danvy (Log. Methods Comput. Sci., 2005)

Theoretical Pearl: A simple proof of a folklore theorem about delimited control. - Dariusz Biernacki; Olivier Danvy (J. Funct. Program., 2006)

On the static and dynamic extents of delimited continuations. - Dariusz Biernacki; Olivier Danvy; Chung-chieh Shan (Sci. Comput. Program., 2006)

Clock-directed modular code generation for synchronous data-flow languages. - Dariusz Biernacki; Jean-Louis Colaço; Grégoire Hamon; Marc Pouzet (LCTES, 2008)

Context-based proofs of termination for typed delimited-control operators. - Malgorzata Biernacka; Dariusz Biernacki (PPDP, 2009)

A Context-based Approach to Proving Termination of Evaluation. - Malgorzata Biernacka; Dariusz Biernacki (MFPS, 2009)

A systematic derivation of the STG machine verified in Coq. - Maciej Piróg; Dariusz Biernacki (Haskell, 2010)

Automating Derivations of Abstract Machines from Reduction Semantics: - A Generic Formalization of Refocusing in Coq. - Filip Sieczkowski; Malgorzata Biernacka; Dariusz Biernacki (IFL, 2010)

Subtyping delimited continuations. - Marek Materzok; Dariusz Biernacki (ICFP, 2011)

Typing control operators in the CPS hierarchy. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet (PPDP, 2011)

A Dynamic Interpretation of the CPS Hierarchy. - Marek Materzok; Dariusz Biernacki (APLAS, 2012)

Normal Form Bisimulations for Delimited-Control Operators. - Dariusz Biernacki; Sergueï Lenglet (FLOPS, 2012)

Applicative Bisimulations for Delimited-Control Operators. - Dariusz Biernacki; Sergueï Lenglet (FoSSaCS, 2012)

Environmental Bisimulations for Delimited-Control Operators. - Dariusz Biernacki; Sergueï Lenglet (APLAS, 2013)

An operational foundation for the tactic language of Coq. - Wojciech Jedynak; Malgorzata Biernacka; Dariusz Biernacki (PPDP, 2013)

Proving termination of evaluation for System F with control operators. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet; Marek Materzok (COS, 2013)

Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus. - Dariusz Biernacki; Sergueï Lenglet (MFPS, 2014)

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations. - Dariusz Biernacki; Olivier Danvy; Kevin Millikin (ACM Trans. Program. Lang. Syst., 2015)

Fully abstract encodings of λ-calculus in HOcore through abstract machines. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk; Damien Pous; Alan Schmitt (LICS, 2017)

Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. - Andrés Aristizábal; Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk (Log. Methods Comput. Sci., 2017)

A Coq formalization of normalization by evaluation for Martin-Löf type theory. - Pawel Wieczorek; Dariusz Biernacki (CPP, 2018)

Proving Soundness of Extensional Normal-Form Bisimilarities. - Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk (MFPS, 2018)

Logical relations for coherence of effect subtyping. - Dariusz Biernacki; Piotr Polesiuk (Log. Methods Comput. Sci., 2018)

Handle with care: relational interpretation of algebraic effects and handlers. - Dariusz Biernacki; Maciej Piróg; Piotr Polesiuk; Filip Sieczkowski (Proc. ACM Program. Lang., 2018)

A Complete Normal-Form Bisimilarity for State. - Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk (FoSSaCS, 2019)

Diacritical Companions. - Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk (MFPS, 2019)

Bisimulations for Delimited-Control Operators. - Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk (Log. Methods Comput. Sci., 2019)

Abstracting algebraic effects. - Dariusz Biernacki; Maciej Piróg; Piotr Polesiuk; Filip Sieczkowski (Proc. ACM Program. Lang., 2019)

An Abstract Machine for Strong Call by Value. - Malgorzata Biernacka; Dariusz Biernacki; Witold Charatonik; Tomasz Drab (APLAS, 2020)

A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers. - Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk (FSCD, 2020)

A Reflection on Continuation-Composing Style. - Dariusz Biernacki; Mateusz Pyzik; Filip Sieczkowski (FSCD, 2020)

Binders by day, labels by night: effect instances via lexically scoped handlers. - Dariusz Biernacki; Maciej Piróg; Piotr Polesiuk; Filip Sieczkowski (Proc. ACM Program. Lang., 2020)

Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines. - Maciej Buszka; Dariusz Biernacki (LOPSTR, 2021)

Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory. - Dariusz Biernacki; Mateusz Pyzik; Filip Sieczkowski (PPDP, 2021)

Non-Deterministic Abstract Machines. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet; Alan Schmitt (CONCUR, 2022)

A General Fine-Grained Reduction Theory for Effect Handlers. - Filip Sieczkowski; Mateusz Pyzik; Dariusz Biernacki (Proc. ACM Program. Lang., 2023)

Optimizing a Non-Deterministic Abstract Machine with Environments. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet; Alan Schmitt (FSCD, 2024)

Fully Abstract Encodings of $ lambda$-Calculus in HOcore through Abstract Machines. - Malgorzata Biernacka; Dariusz Biernacki; Sergueï Lenglet; Piotr Polesiuk; Damien Pous; Alan Schmitt (Log. Methods Comput. Sci., 2024)