Malgorzata Biernacka

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 13

Top Topics

Abstract Machine

Lambda Calculus

Top Venues

Proc. ACM Program. Lang.

Publications

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt
Optimizing a Non-Deterministic Abstract Machine with Environments. FSCD (2024)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines. Log. Methods Comput. Sci. 20 (3) (2024)
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
The Zoo of Lambda-Calculus Reduction Strategies, And Coq. ITP (2022)
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
A simple and efficient implementation of strong call by need by an abstract machine. Proc. ACM Program. Lang. 6 (ICFP) (2022)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. CoRR (2022)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt
Non-Deterministic Abstract Machines. CONCUR (2022)
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
A Derived Reasonable Abstract Machine for Strong Call by Value. PPDP (2021)
Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
Strong Call by Value is Reasonable for Time. CoRR (2021)
Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
An Abstract Machine for Strong Call by Value. APLAS (2020)
Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
An Abstract Machine for Strong Call by Value. CoRR (2020)
Malgorzata Biernacka, Witold Charatonik
Deriving an Abstract Machine for Strong Call by Need. FSCD (2019)
Malgorzata Biernacka, Witold Charatonik, Klara Zielinska
Generalized Refocusing: From Hybrid Strategies to Abstract Machines. FSCD (2017)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
Fully abstract encodings of λ-calculus in HOcore through abstract machines. LICS (2017)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Marek Materzok
Proving termination of evaluation for System F with control operators. COS (2013)
Wojciech Jedynak, Malgorzata Biernacka, Dariusz Biernacki
An operational foundation for the tactic language of Coq. PPDP (2013)
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet
Typing control operators in the CPS hierarchy. PPDP (2011)
Filip Sieczkowski, Malgorzata Biernacka, Dariusz Biernacki
Automating Derivations of Abstract Machines from Reduction Semantics: - A Generic Formalization of Refocusing in Coq. IFL (2010)
Malgorzata Biernacka, Dariusz Biernacki
Context-based proofs of termination for typed delimited-control operators. PPDP (2009)
Malgorzata Biernacka, Olivier Danvy
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. Semantics and Algebraic Specification (2009)
Malgorzata Biernacka, Dariusz Biernacki
A Context-based Approach to Proving Termination of Evaluation. MFPS (2009)
Malgorzata Biernacka, Olivier Danvy
A syntactic correspondence between context-sensitive calculi and abstract machines. Theor. Comput. Sci. 375 (1-3) (2007)
Malgorzata Biernacka, Olivier Danvy
A concrete framework for environment machines. ACM Trans. Comput. Log. 9 (1) (2007)
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
An Operational Foundation for Delimited Continuations in the CPS Hierarchy. Log. Methods Comput. Sci. 1 (2) (2005)
Malgorzata Biernacka, Olivier Danvy, Kristian Støvring
Program Extraction From Proofs of Weak Head Normalization. MFPS (2005)
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
An Operational Foundation for Delimited Continuations in the CPS Hierarchy CoRR (2005)