default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDariusz Biernacki
Person information
- affiliation: University of Wroclaw, Poland
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]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)- [c30]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt:
Optimizing a Non-Deterministic Abstract Machine with Environments. FSCD 2024: 11:1-11:22 - 2023
- [j13]Filip Sieczkowski
, Mateusz Pyzik, Dariusz Biernacki:
A General Fine-Grained Reduction Theory for Effect Handlers. Proc. ACM Program. Lang. 7(ICFP): 511-540 (2023) - 2022
- [c29]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Alan Schmitt:
Non-Deterministic Abstract Machines. CONCUR 2022: 7:1-7:24 - [i11]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully Abstract Encodings of λ-Calculus in HOcore through Abstract Machines. CoRR abs/2205.06665 (2022) - 2021
- [c28]Maciej Buszka, Dariusz Biernacki:
Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines. LOPSTR 2021: 38-59 - [c27]Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski:
Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory. PPDP 2021: 4:1-4:13 - [i10]Maciej Buszka, Dariusz Biernacki:
Automating the Functional Correspondence between Higher-Order Evaluators and Abstract Machines. CoRR abs/2108.07132 (2021) - 2020
- [j12]Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski:
Binders by day, labels by night: effect instances via lexically scoped handlers. Proc. ACM Program. Lang. 4(POPL): 48:1-48:29 (2020) - [c26]Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab:
An Abstract Machine for Strong Call by Value. APLAS 2020: 147-166 - [c25]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
A Complete Normal-Form Bisimilarity for Algebraic Effects and Handlers. FSCD 2020: 7:1-7:22 - [c24]Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski:
A Reflection on Continuation-Composing Style. FSCD 2020: 18:1-18:17 - [i9]Malgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab:
An Abstract Machine for Strong Call by Value. CoRR abs/2009.06984 (2020)
2010 – 2019
- 2019
- [j11]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Proving Soundness of Extensional Normal-Form Bisimilarities. Log. Methods Comput. Sci. 15(1) (2019) - [j10]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Bisimulations for Delimited-Control Operators. Log. Methods Comput. Sci. 15(2) (2019) - [j9]Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski:
Abstracting algebraic effects. Proc. ACM Program. Lang. 3(POPL): 6:1-6:28 (2019) - [c23]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
A Complete Normal-Form Bisimilarity for State. FoSSaCS 2019: 98-114 - [c22]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Diacritical Companions. MFPS 2019: 25-43 - 2018
- [j8]Dariusz Biernacki, Piotr Polesiuk:
Logical relations for coherence of effect subtyping. Log. Methods Comput. Sci. 14(1) (2018) - [j7]Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, Filip Sieczkowski:
Handle with care: relational interpretation of algebraic effects and handlers. Proc. ACM Program. Lang. 2(POPL): 8:1-8:30 (2018) - [c21]Pawel Wieczorek, Dariusz Biernacki:
A Coq formalization of normalization by evaluation for Martin-Löf type theory. CPP 2018: 266-279 - [c20]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Proving Soundness of Extensional Normal-Form Bisimilarities. MFPS 2018: 41-56 - [i8]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Bisimulations for Delimited-Control Operators. CoRR abs/1804.08373 (2018) - 2017
- [j6]Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. Log. Methods Comput. Sci. 13(3) (2017) - [c19]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt:
Fully abstract encodings of λ-calculus in HOcore through abstract machines. LICS 2017: 1-12 - [i7]Dariusz Biernacki, Piotr Polesiuk:
Logical relations for coherence of effect subtyping. CoRR abs/1710.09469 (2017) - [i6]Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Proving Soundness of Extensional Normal-Form Bisimilarities. CoRR abs/1711.00113 (2017) - 2016
- [c18]Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. FSCD 2016: 9:1-9:17 - [i5]Andrés Aristizábal, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk:
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation. CoRR abs/1611.09626 (2016) - 2015
- [j5]Dariusz Biernacki, Olivier Danvy, Kevin Millikin:
A Dynamic Continuation-Passing Style for Dynamic Delimited Continuations. ACM Trans. Program. Lang. Syst. 38(1): 2:1-2:25 (2015) - [c17]Dariusz Biernacki, Piotr Polesiuk:
Logical Relations for Coherence of Effect Subtyping. TLCA 2015: 107-122 - 2014
- [c16]Dariusz Biernacki, Sergueï Lenglet:
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus. MFPS 2014: 49-64 - 2013
- [c15]Dariusz Biernacki, Sergueï Lenglet:
Environmental Bisimulations for Delimited-Control Operators. APLAS 2013: 333-348 - [c14]Wojciech Jedynak, Malgorzata Biernacka, Dariusz Biernacki:
An operational foundation for the tactic language of Coq. PPDP 2013: 25-36 - [c13]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Marek Materzok:
Proving termination of evaluation for System F with control operators. COS 2013: 15-29 - [i4]Dariusz Biernacki, Sergueï Lenglet:
Environmental Bisimulations for Delimited-Control Operators. CoRR abs/1309.3919 (2013) - 2012
- [c12]Marek Materzok, Dariusz Biernacki:
A Dynamic Interpretation of the CPS Hierarchy. APLAS 2012: 296-311 - [c11]Dariusz Biernacki, Sergueï Lenglet:
Normal Form Bisimulations for Delimited-Control Operators. FLOPS 2012: 47-61 - [c10]Dariusz Biernacki, Sergueï Lenglet:
Applicative Bisimulations for Delimited-Control Operators. FoSSaCS 2012: 119-134 - [i3]Dariusz Biernacki, Sergueï Lenglet:
Applicative Bisimulations for Delimited-Control Operators. CoRR abs/1201.0874 (2012) - [i2]Dariusz Biernacki, Sergueï Lenglet:
Normal Form Bisimulations for Delimited-Control Operators. CoRR abs/1202.5959 (2012) - 2011
- [c9]Marek Materzok, Dariusz Biernacki:
Subtyping delimited continuations. ICFP 2011: 81-93 - [c8]Malgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet:
Typing control operators in the CPS hierarchy. PPDP 2011: 149-160 - 2010
- [c7]Maciej Piróg, Dariusz Biernacki:
A systematic derivation of the STG machine verified in Coq. Haskell 2010: 25-36 - [c6]Filip Sieczkowski, Malgorzata Biernacka, Dariusz Biernacki:
Automating Derivations of Abstract Machines from Reduction Semantics: - A Generic Formalization of Refocusing in Coq. IFL 2010: 72-88
2000 – 2009
- 2009
- [c5]Malgorzata Biernacka, Dariusz Biernacki:
Context-based proofs of termination for typed delimited-control operators. PPDP 2009: 289-300 - [c4]Malgorzata Biernacka, Dariusz Biernacki:
A Context-based Approach to Proving Termination of Evaluation. MFPS 2009: 169-192 - 2008
- [c3]Dariusz Biernacki, Jean-Louis Colaço, Grégoire Hamon, Marc Pouzet:
Clock-directed modular code generation for synchronous data-flow languages. LCTES 2008: 121-130 - 2006
- [j4]Dariusz Biernacki, Olivier Danvy:
Theoretical Pearl: A simple proof of a folklore theorem about delimited control. J. Funct. Program. 16(3): 269-280 (2006) - [j3]Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan:
On the static and dynamic extents of delimited continuations. Sci. Comput. Program. 60(3): 274-297 (2006) - 2005
- [j2]Dariusz Biernacki, Olivier Danvy, Chung-chieh Shan:
On the dynamic extent of delimited continuations. Inf. Process. Lett. 96(1): 7-17 (2005) - [j1]Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy:
An Operational Foundation for Delimited Continuations in the CPS Hierarchy. Log. Methods Comput. Sci. 1(2) (2005) - [i1]Malgorzata Biernacka, Dariusz Biernacki, Olivier Danvy:
An Operational Foundation for Delimited Continuations in the CPS Hierarchy. CoRR abs/cs/0508048 (2005) - 2003
- [c2]Dariusz Biernacki, Olivier Danvy:
From Interpreter to Logic Engine by Defunctionalization. LOPSTR 2003: 143-159 - [c1]Mads Sig Ager, Dariusz Biernacki, Olivier Danvy, Jan Midtgaard:
A functional correspondence between evaluators and abstract machines. PPDP 2003: 8-19
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
