( en | de | ru )

 

Disambiguation of "Biernacki, Dariusz"

Author of the publication

copydeleteadd this publication to your clipboard
A Complete Normal-Form Bisimilarity for State.

, , and . FoSSaCS, volume 11425 of Lecture Notes in Computer Science, page 98-114. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stephanie Biernacki

Dariusz Wawro

Dariusz Wolany

Dariusz Zakrzewicz

Dariusz Oko

 

Other publications of authors with the same name

A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers., , and . FSCD, volume 167 of LIPIcs, page 7:1-7:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Clock-directed modular code generation for synchronous data-flow languages., , , and . LCTES, page 121-130. ACM, (2008)A General Fine-Grained Reduction Theory for Effect Handlers., , and . Proc. ACM Program. Lang., 7 (ICFP): 511-540 (August 2023)Theoretical Pearl: A simple proof of a folklore theorem about delimited control., and . J. Funct. Program., 16 (3): 269-280 (2006)Non-Deterministic Abstract Machines., , , and . CONCUR, volume 243 of LIPIcs, page 7:1-7:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Handle with care: relational interpretation of algebraic effects and handlers., , , and . Proc. ACM Program. Lang., 2 (POPL): 8:1-8:30 (2018)Binders by day, labels by night: effect instances via lexically scoped handlers., , , and . Proc. ACM Program. Lang., 4 (POPL): 48:1-48:29 (2020)Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory., , and . PPDP, page 4:1-4:13. ACM, (2021)Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines., and . LOPSTR, volume 13290 of Lecture Notes in Computer Science, page 38-59. Springer, (2021)A systematic derivation of the STG machine verified in Coq., and . Haskell, page 25-36. ACM, (2010)