Program Extraction From Proofs of Weak Head Normalization. - Malgorzata Biernacka; Olivier Danvy; Kristian Støvring (MFPS, 2005)

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

A syntactic correspondence between context-sensitive calculi and abstract machines. - Malgorzata Biernacka; Olivier Danvy (Theor. Comput. Sci., 2007)

A concrete framework for environment machines. - Malgorzata Biernacka; Olivier Danvy (ACM Trans. Comput. Log., 2007)

Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. - Malgorzata Biernacka; Olivier Danvy (Semantics and Algebraic Specification, 2009)

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)

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

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

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)

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

Generalized Refocusing: From Hybrid Strategies to Abstract Machines. - Malgorzata Biernacka; Witold Charatonik; Klara Zielinska (FSCD, 2017)

Deriving an Abstract Machine for Strong Call by Need. - Malgorzata Biernacka; Witold Charatonik (FSCD, 2019)

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

A Derived Reasonable Abstract Machine for Strong Call by Value. - Malgorzata Biernacka; Witold Charatonik; Tomasz Drab (PPDP, 2021)

Strong Call by Value is Reasonable for Time. - Malgorzata Biernacka; Witold Charatonik; Tomasz Drab (CoRR, 2021)

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

The Zoo of Lambda-Calculus Reduction Strategies, And Coq. - Malgorzata Biernacka; Witold Charatonik; Tomasz Drab (ITP, 2022)

A simple and efficient implementation of strong call by need by an abstract machine. - Malgorzata Biernacka; Witold Charatonik; Tomasz Drab (Proc. ACM Program. Lang., 2022)

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)