Dariusz Biernacki

According to our database, Dariusz Biernacki authored at least 39 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

A General Fine-Grained Reduction Theory for Effect Handlers.

Filip Sieczkowski, Mateusz Pyzik, Dariusz Biernacki

Proc. ACM Program. Lang., August, 2023

2022

Non-Deterministic Abstract Machines.

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt

Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021

Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory.

Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski

Proceedings of the PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021

Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines.

Maciej Buszka, Dariusz Biernacki

Proceedings of the Logic-Based Program Synthesis and Transformation, 2021

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

A Reflection on Continuation-Composing Style.

Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers.

Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

An Abstract Machine for Strong Call by Value.

Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab

Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

2019

Abstracting algebraic effects.

Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski

Proc. ACM Program. Lang., 2019

Bisimulations for Delimited-Control Operators.

Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk

Log. Methods Comput. Sci., 2019

Diacritical Companions.

Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk

Proceedings of the Thirty-Fifth Conference on the Mathematical Foundations of Programming Semantics, 2019

A Complete Normal-Form Bisimilarity for State.

Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk

Proceedings of the Foundations of Software Science and Computation Structures, 2019

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

Logical relations for coherence of effect subtyping.

Dariusz Biernacki, Piotr Polesiuk

Log. Methods Comput. Sci., 2018

Proving Soundness of Extensional Normal-Form Bisimilarities.

Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk

Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

A Coq formalization of normalization by evaluation for Martin-Löf type theory.

Pawel Wieczorek, Dariusz Biernacki

Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2018

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

Fully abstract encodings of λ-calculus in HOcore through abstract machines.

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2015

A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations.

Dariusz Biernacki, Olivier Danvy, Kevin Millikin

ACM Trans. Program. Lang. Syst., 2015

2014

Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus.

Dariusz Biernacki, Sergueï Lenglet

Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

2013

Proving termination of evaluation for System F with control operators.

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Marek Materzok

Proceedings of the Proceedings First Workshop on Control Operators and their Semantics, 2013

An operational foundation for the tactic language of Coq.

Wojciech Jedynak, Malgorzata Biernacka, Dariusz Biernacki

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Environmental Bisimulations for Delimited-Control Operators.

Dariusz Biernacki, Sergueï Lenglet

Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012

Applicative Bisimulations for Delimited-Control Operators.

Dariusz Biernacki, Sergueï Lenglet

Proceedings of the Foundations of Software Science and Computational Structures, 2012

Normal Form Bisimulations for Delimited-Control Operators.

Dariusz Biernacki, Sergueï Lenglet

Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

A Dynamic Interpretation of the CPS Hierarchy.

Marek Materzok, Dariusz Biernacki

Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2011

Typing control operators in the CPS hierarchy.

Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet

Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Subtyping delimited continuations.

Marek Materzok, Dariusz Biernacki

Proceedings of the Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, 2011

2010

Automating Derivations of Abstract Machines from Reduction Semantics: - A Generic Formalization of Refocusing in Coq.

Filip Sieczkowski, Malgorzata Biernacka, Dariusz Biernacki

Proceedings of the Implementation and Application of Functional Languages, 2010

A systematic derivation of the STG machine verified in Coq.

Maciej Piróg, Dariusz Biernacki

Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell, 2010

2009

A Context-based Approach to Proving Termination of Evaluation.

Malgorzata Biernacka, Dariusz Biernacki

Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Context-based proofs of termination for typed delimited-control operators.

Malgorzata Biernacka, Dariusz Biernacki

Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

2008

Clock-directed modular code generation for synchronous data-flow languages.

Dariusz Biernacki, Jean-Louis Colaço, Grégoire Hamon, Marc Pouzet

Proceedings of the 2008 ACM SIGPLAN/SIGBED Conference on Languages, 2008

2006

On the static and dynamic extents of delimited continuations.

Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan

Sci. Comput. Program., 2006

Theoretical Pearl: A simple proof of a folklore theorem about delimited control.

Dariusz Biernacki, Olivier Danvy

J. Funct. Program., 2006

2005

An Operational Foundation for Delimited Continuations in the CPS Hierarchy.

Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy

Log. Methods Comput. Sci., 2005

On the dynamic extent of delimited continuations.

Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan

Inf. Process. Lett., 2005

2003

A functional correspondence between evaluators and abstract machines.

Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard

Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

From Interpreter to Logic Engine by Defunctionalization.

Dariusz Biernacki, Olivier Danvy

Proceedings of the Logic Based Program Synthesis and Transformation, 2003