Dariusz Biernacki

Orcid: 0000-0002-1477-4635

Affiliations:
  • University of Wroclaw, Poland


According to our database1, Dariusz Biernacki authored at least 41 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines.
Log. Methods Comput. Sci., 2024

Optimizing a Non-Deterministic Abstract Machine with Environments.
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

2023
A General Fine-Grained Reduction Theory for Effect Handlers.
Proc. ACM Program. Lang., August, 2023

2022
Non-Deterministic Abstract Machines.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory.
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.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2021

2020
Binders by day, labels by night: effect instances via lexically scoped handlers.
Proc. ACM Program. Lang., 2020

A Reflection on Continuation-Composing Style.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

An Abstract Machine for Strong Call by Value.
Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

2019
Abstracting algebraic effects.
Proc. ACM Program. Lang., 2019

Bisimulations for Delimited-Control Operators.
Log. Methods Comput. Sci., 2019

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

A Complete Normal-Form Bisimilarity for State.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Handle with care: relational interpretation of algebraic effects and handlers.
Proc. ACM Program. Lang., 2018

Logical relations for coherence of effect subtyping.
Log. Methods Comput. Sci., 2018

Proving Soundness of Extensional Normal-Form Bisimilarities.
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.
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.
Log. Methods Comput. Sci., 2017

Fully abstract encodings of λ-calculus in HOcore through abstract machines.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2015
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations.
ACM Trans. Program. Lang. Syst., 2015

2014
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus.
Proceedings of the 30th Conference on the Mathematical Foundations of Programming Semantics, 2014

2013
Proving termination of evaluation for System F with control operators.
Proceedings of the Proceedings First Workshop on Control Operators and their Semantics, 2013

An operational foundation for the tactic language of Coq.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Environmental Bisimulations for Delimited-Control Operators.
Proceedings of the Programming Languages and Systems - 11th Asian Symposium, 2013

2012
Applicative Bisimulations for Delimited-Control Operators.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

Normal Form Bisimulations for Delimited-Control Operators.
Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012

A Dynamic Interpretation of the CPS Hierarchy.
Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2011
Typing control operators in the CPS hierarchy.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Subtyping delimited continuations.
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.
Proceedings of the Implementation and Application of Functional Languages, 2010

A systematic derivation of the STG machine verified in Coq.
Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell, 2010

2009
A Context-based Approach to Proving Termination of Evaluation.
Proceedings of the 25th Conference on Mathematical Foundations of Programming Semantics, 2009

Context-based proofs of termination for typed delimited-control operators.
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.
Proceedings of the 2008 ACM SIGPLAN/SIGBED Conference on Languages, 2008

2006
On the static and dynamic extents of delimited continuations.
Sci. Comput. Program., 2006

Theoretical Pearl: A simple proof of a folklore theorem about delimited control.
J. Funct. Program., 2006

2005
An Operational Foundation for Delimited Continuations in the CPS Hierarchy.
Log. Methods Comput. Sci., 2005

On the dynamic extent of delimited continuations.
Inf. Process. Lett., 2005

2003
A functional correspondence between evaluators and abstract machines.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

From Interpreter to Logic Engine by Defunctionalization.
Proceedings of the Logic Based Program Synthesis and Transformation, 2003


  Loading...