Dariusz Biernacki

56 papers A* 1A 1B 16C 8Misc 1Journal 26Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Call-by-value and call-by-name: A simple proof of a classic theorem.
J. Funct. Program.
Dariusz Biernacki, James McKinna, Filip Sieczkowski
2024 J jnl
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines.
Log. Methods Comput. Sci.
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
2024 B conf
Optimizing a Non-Deterministic Abstract Machine with Environments.
FSCD
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt
2023 J jnl
A General Fine-Grained Reduction Theory for Effect Handlers.
Proc. ACM Program. Lang.
Filip Sieczkowski, Mateusz Pyzik, Dariusz Biernacki
2022 J jnl
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines.
CoRR
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
2022 B conf
Non-Deterministic Abstract Machines.
CONCUR
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt
2021 C conf
Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines.
LOPSTR
Maciej Buszka, Dariusz Biernacki
2021 J jnl
Automating the Functional Correspondence between Higher-Order Evaluators and Abstract Machines.
CoRR
Maciej Buszka, Dariusz Biernacki
2021 C conf
Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory.
PPDP
Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski
2020 B conf
A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers.
FSCD
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2020 B conf
A Reflection on Continuation-Composing Style.
FSCD
Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski
2020 B conf
An Abstract Machine for Strong Call by Value.
APLAS
Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
2020 J jnl
An Abstract Machine for Strong Call by Value.
CoRR
Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
2020 J jnl
Binders by day, labels by night: effect instances via lexically scoped handlers.
Proc. ACM Program. Lang.
Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski
2019 B conf
A Complete Normal-Form Bisimilarity for State.
FoSSaCS
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2019 J jnl
Abstracting algebraic effects.
Proc. ACM Program. Lang.
Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski
2019 J jnl
Bisimulations for Delimited-Control Operators.
Log. Methods Comput. Sci.
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2019 B conf
Diacritical Companions.
MFPS
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2019 J jnl
Proving Soundness of Extensional Normal-Form Bisimilarities.
Log. Methods Comput. Sci.
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2018 B conf
A Coq formalization of normalization by evaluation for Martin-Löf type theory.
CPP
Pawel Wieczorek, Dariusz Biernacki
2018 J jnl
Bisimulations for Delimited-Control Operators.
CoRR
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2018 J jnl
Handle with care: relational interpretation of algebraic effects and handlers.
Proc. ACM Program. Lang.
Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski
2018 J jnl
Logical relations for coherence of effect subtyping.
Log. Methods Comput. Sci.
Dariusz Biernacki, Piotr Polesiuk
2018 B conf
Proving Soundness of Extensional Normal-Form Bisimilarities.
MFPS
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2017 J jnl
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation.
Log. Methods Comput. Sci.
Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2017 A* conf
Fully abstract encodings of λ-calculus in HOcore through abstract machines.
LICS
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt
2017 J jnl
Logical relations for coherence of effect subtyping.
CoRR
Dariusz Biernacki, Piotr Polesiuk
2017 J jnl
Proving Soundness of Extensional Normal-Form Bisimilarities.
CoRR
Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2016 B conf
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation.
FSCD
Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2016 J jnl
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation.
CoRR
Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk
2015 J jnl
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations.
ACM Trans. Program. Lang. Syst.
Dariusz Biernacki, Olivier Danvy, Kevin Millikin
2015 — conf
Logical Relations for Coherence of Effect Subtyping.
TLCA
Dariusz Biernacki, Piotr Polesiuk
2014 B conf
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus.
MFPS
Dariusz Biernacki, Sergueï Lenglet
2013 C conf
An operational foundation for the tactic language of Coq.
PPDP
Wojciech Jedynak, Malgorzata Biernacka, Dariusz Biernacki
2013 B conf
Environmental Bisimulations for Delimited-Control Operators.
APLAS
Dariusz Biernacki, Sergueï Lenglet
2013 J jnl
Environmental Bisimulations for Delimited-Control Operators.
CoRR
Dariusz Biernacki, Sergueï Lenglet
2013 — conf
Proving termination of evaluation for System F with control operators.
COS
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Marek Materzok
2012 B conf
A Dynamic Interpretation of the CPS Hierarchy.
APLAS
Marek Materzok, Dariusz Biernacki
2012 J jnl
Applicative Bisimulations for Delimited-Control Operators
CoRR
Dariusz Biernacki, Sergueï Lenglet
2012 B conf
Applicative Bisimulations for Delimited-Control Operators.
FoSSaCS
Dariusz Biernacki, Sergueï Lenglet
2012 J jnl
Normal Form Bisimulations for Delimited-Control Operators
CoRR
Dariusz Biernacki, Sergueï Lenglet
2012 Misc conf
Normal Form Bisimulations for Delimited-Control Operators.
FLOPS
Dariusz Biernacki, Sergueï Lenglet
2011 A conf
Subtyping delimited continuations.
ICFP
Marek Materzok, Dariusz Biernacki
2011 C conf
Typing control operators in the CPS hierarchy.
PPDP
Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet
2010 C conf
A systematic derivation of the STG machine verified in Coq.
Haskell
Maciej Piróg, Dariusz Biernacki
2010 — conf
Automating Derivations of Abstract Machines from Reduction Semantics: - A Generic Formalization of Refocusing in Coq.
IFL
Filip Sieczkowski, Malgorzata Biernacka, Dariusz Biernacki
2009 B conf
A Context-based Approach to Proving Termination of Evaluation.
MFPS
Malgorzata Biernacka, Dariusz Biernacki
2009 C conf
Context-based proofs of termination for typed delimited-control operators.
PPDP
Malgorzata Biernacka, Dariusz Biernacki
2008 B conf
Clock-directed modular code generation for synchronous data-flow languages.
LCTES
Dariusz Biernacki, Jean-Louis Colaço, Grégoire Hamon, Marc Pouzet
2006 J jnl
On the static and dynamic extents of delimited continuations.
Sci. Comput. Program.
Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan
2006 J jnl
Theoretical Pearl: A simple proof of a folklore theorem about delimited control.
J. Funct. Program.
Dariusz Biernacki, Olivier Danvy
2005 J jnl
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
CoRR
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
2005 J jnl
An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
Log. Methods Comput. Sci.
Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy
2005 J jnl
On the dynamic extent of delimited continuations.
Inf. Process. Lett.
Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan
2003 C conf
A functional correspondence between evaluators and abstract machines.
PPDP
Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard
2003 C conf
From Interpreter to Logic Engine by Defunctionalization.
LOPSTR
Dariusz Biernacki, Olivier Danvy