International journals and conference proceedings:
Non-Deterministic Abstract Machines.
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet,
Alan Schmitt.
CONCUR 2022: 7:1-7:24
Reflecting Stacked Continuations in a Fine-Grained
Direct-Style Reduction Theory.
Dariusz Biernacki,
Mateusz Pyzik, and Filip- Sieczkowski.
In PPDP
2021: 23rd International Symposium on Principles and
Practice of Declarative Programming. Tallinn, Estonia,
September 6-8, 2021.
Automating the Functional Correspondence between
Higher-Order Evaluators and Abstract Machines.
Maciej Buszka and Dariusz Biernacki.
In Pre-proceedings of the 31st International Symposium
on Logic-Based Program Synthesis and Transformation
(LOPSTR 2021), Tallinn, Estonia, September 7-8, 2021.
An Abstract Machine for Strong Call by Value.
Małgorzata Biernacka, Dariusz Biernacki, Witold
Charatonik, and Tomasz Drab.
APLAS 2020:
147-166.
A Complete Normal-Form Bisimilarity for Algebraic
Effects and Handlers.
Dariusz Biernacki, Sergueï
Lenglet, and Piotr Polesiuk.
FSCD 2020:
7:1-7:22.
A Reflection on Continuation-Composing Style.
Dariusz Biernacki, Mateusz Pyzik, and Filip Sieczkowski.
FSCD 2020: 18:1-18:17.
Binders by Day, Labels by Night: Effect Instances via
Lexically Scoped Handlers.
Dariusz Biernacki,
Maciej Piróg, Piotr Polesiuk, and Filip Sieczkowski.
The 47th ACM SIGPLAN Symposium on Principles of
Programming Languages (POPL 2020), New Orleans,
Louisiana, United States, January 2020.
[PDF]
Bisimulations for Delimited-Control Operators.
Dariusz Biernacki, Sergueï Lenglet, and Piotr
Polesiuk.
Logical Methods in Computer Science (LMCS) 15
(2-18):1-57, 2019.
[PDF]
Diacritical Companions.
Dariusz Biernacki, Piotr Polesiuk, and Sergueï Lenglet.
The 35th Conference on the Mathematical Foundations
of Programming Semantics (MFPS 2019), London, UK, June
4–7, 2019. ENTCS 347, pp. 25-43.
[PDF]
A Complete Normal-Form Bisimilarity for State.
Dariusz Biernacki, Piotr Polesiuk, and Sergueï Lenglet.
In 22nd International Conference, FOSSACS 2019,
Held as Part of the European Joint Conferences on Theory
and Practice of Software, ETAPS 2019, Prague, Czech
Republic, April 6–11, 2019, Proceedings,
pp. 98-114. LNCS 11425, 2019. Springer.
[PDF]
[Technical report]
Proving Soundness of Extensional Normal-Form Bisimilarities.
Dariusz Biernacki, Sergueï Lenglet, and Piotr Polesiuk.
Logical Methods in Computer Science (LMCS) 15
(1:31):1-24, 2019. Selected papers of the 33rd
Conference on the Mathematical Foundations of Programming
Semantics (MFPS XXXIII).
An extended and revised version of the MFPS'17 paper.
[PDF]
[Coq development]
Abstracting Algebraic Effects.
Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, and Filip Sieczkowski.
In 46th ACM SIGPLAN Symposium on Principles of
Programming Languages (POPL 2019), Cascais, Portugal,
January 13–19, 2019.
[PDF]
[Helium]
Programming with Abstract Algebraic Effects.
Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, and Filip Sieczkowski.
ML Family Workshop 2018, Saint Louis (MO), USA, September 2018.
[PDF]
Logical Relations for Coherence of Effect Subtyping.
Dariusz Biernacki and Piotr Polesiuk.
Logical Methods in Computer Science (LMCS) 14
(1:11):1-28, 2018. Selected papers of the joint 26th
International Conference on "Rewriting Techniques and
Applications" and 13th International Conference on "Typed
Lambda Calculi and Applications" RTA/TLCA 2015.
An extended and revised version of the TLCA'15 paper.
[PDF]
[Coq development]
A Coq Formalization of Normalization by Evaluation for
Martin-Löf Type Theory.
Paweł Wieczorek and Dariusz Biernacki.
In 7th ACM SIGPLAN International Conference on
Certified Programs and Proofs, CPP 2018. Los Angeles,
CA, USA, January 8-9, 2018.
[PDF]
[Coq development]
Handle with Care: Relational Interpretation of
Algebraic Effects and Handlers.
Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, and Filip
Sieczkowski.
In 45th ACM SIGPLAN Symposium on Principles of
Programming Languages, POPL 2018, Los Angeles, CA,
USA, January 10-12, 2018.
[PDF]
[Coq development]
Logical Relations for Algebraic Effects.
Dariusz Biernacki, Maciej Piróg, Piotr Polesiuk, and Filip
Sieczkowski.
In The 6th ACM SIGPLAN Workshop on Higher-Order
Programming with Effects (HOPE 2017), Oxford, United
Kingdom, September 2017.
Environmental Bisimulations for Delimited-Control Operators with
Dynamic Prompt Generation.
Andrés Aristizábal,
Dariusz Biernacki, Sergueï Lenglet, and Piotr Polesiuk.
Logical Methods in Computer Science, 13
(3:27):1-26, 2017. Selected Papers of the 1st
International Conference on Formal Structures and
Deduction (FSCD 2016).
An extended and revised version of the FSCD'16 paper.
[PDF]
[Technical report]
Proving Soundness of Extensional Normal-Form Bisimilarities.
Dariusz Biernacki, Sergueï Lenglet, and Piotr Polesiuk.
In 33rd Conference on the Mathematical Foundations of
Programming Semantics (MFPS XXXIII), Ljubljana,
Slovenia, June 2017. ENTCS 336, pp. 41-56.
[PDF]
[Coq development]
Fully Abstract Encodings of λ-Calculus in HOcore through
Abstract Machines.
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet,
Piotr Polesiuk, Damien Pous, and Alan Schmitt.
In 32nd Annual ACM/IEEE Symposium on Logic in Computer
Science (LICS), pp. 1-12, Reykjavik, Iceland, June
2017. IEEE Computer Society.
[PDF]
[Technical report]
Environmental Bisimulations for Delimited-Control Operators with
Dynamic Prompt Generation.
Andrés Aristizábal,
Dariusz Biernacki, Sergueï Lenglet, and Piotr Polesiuk.
In Delia Kesner and Brigitte Pientka, editors, 1st
International Conference on Formal Structures for
Computation and Deduction, FSCD 2016, pp. 9:1-9:17,
Porto, Portugal, June 2016. LIPIcs 52, Schloss Dagstuhl –
Leibniz-Zentrum fuer Informatik 2016.
Best Paper Award.
[PDF]
[Technical report]
A Dynamic Continuation-Passing Style for Dynamic
Delimited Continuations.
Dariusz Biernacki,
Olivier Danvy, and Kevin Millikin.
ACM Transactions on Programming Languages and Systems
(TOPLAS), 38(1):2:1-2:25, 2015.
[PDF]
[SML implementation]
Logical Relations for Coherence of Effect Subtyping.
Dariusz Biernacki and Piotr Polesiuk.
In Thorsten Altenkirch, editor, Proceedings of the 13th
International Conference on Typed Lambda Calculi and
Applications (TLCA 2015), pp. 107-122, Warsaw, Poland,
July 2015. LIPIcs 38, 2015. Schloss Dagstuhl –
Leibniz-Zentrum fuer Informatik.
[PDF]
[Coq development]
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus.
Dariusz Biernacki and Sergueï Lenglet.
In Bart Jacobs, Alexandra Silva, and Sam Staton,
editors, Proceedings of the 30th Conference on the
Mathematical Foundations of Programming Semantics (MFPS
XXX), pp. 49-64, Ithaca, NY, June 2014. ENTCS 308,
2014. Elsevier.
[PDF]
[Technical report]
Environmental Bisimulations for Delimited-Control Operators.
Dariusz Biernacki and Sergueï Lenglet.
In Chung-chieh Shan, editor, Proceedings of the 11th
Asian Symposium on Programming Languages and Systems
(APLAS 2013), pp. 333-348, Melbourne, Australia,
December 2013. LNCS 8301, 2013. Springer.
[PDF]
[Technical report]
An Operational Foundation for the Tactic Language of Coq.
Wojciech Jedynak, Małgorzata Biernacka, and Dariusz Biernacki.
In Ricardo Peña and Tom Shrijvers, editors, Proceedings
of the 15th International Symposium on Principles and
Practice of Declarative Programming (PPDP 2013),
pp. 25-36, Madrid, Spain, September 2013. ACM Press.
[PDF]
Proving Termination of Evaluation for System F with
Control Operators.
Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet,
and Marek Materzok.
In U. de'Liguoro and A. Saurin, editors, Proceedings of
the 1st Workshop on Control Operators and their Semantics
(COS 2013), pp. 15-29, Eindhoven, The Netherlands,
June
2013. EPTCS
127, 2013.
[PDF]
A Dynamic Interpretation of the CPS Hierarchy.
Marek Materzok and Dariusz Biernacki.
In R. Jhala and A. Igarashi, editors, Proceedings of
the 10th Asian Symposium on Programming Languages and
Systems (APLAS 2012), pp. 296-311, Kyoto, Japan,
December 2012. LNCS 7705, 2012. Springer.
[PDF]
Normal Form Bisimulations for Delimited-Control Operators.
Dariusz Biernacki and Sergueï Lenglet.
In T. Shrijvers and P. Thiemann, editors, Proceedings
of the 11th International Symposium on Functional and
Logic Programming (FLOPS 2012), pp. 47-61, Kobe,
Japan, May 2012. LNCS 7294, 2012. Springer.
[PDF]
[Technical report]
Applicative Bisimulations for Delimited-Control Operators.
Dariusz Biernacki and Sergueï Lenglet.
In L. Birkedal, editor, Proceedings of the 15th
International Conference on Foundations of Software
Science and Computation Structures (FoSSaCS 2012),
pp. 119-134, Tallinn, Estonia, March 2012. LNCS 7213,
2012. Springer.
[PDF]
[Technical report]
Subtyping Delimited Continuations.
Marek Materzok and Dariusz Biernacki.
In M. Chakravarty, Z. Hu and O. Danvy, editors,
Proceedings of the 16th ACM SIGPLAN International
Conference on Functional Programming (ICFP 2011),
pp. 81-93, Tokyo, Japan, September 2011. ACM Press.
[PDF]
[Twelf
formalization]
[Haskell
implementation]
An extended version accepted for publication
in Higher-Order and Symbolic Computation.
[PDF]
Typing Control Operators in the CPS Hierarchy.
Małgorzata Biernacka, Dariusz Biernacki, and Sergueï Lenglet.
In P. Schneider-Kamp and M. Hanus,
editors, Proceedings of the 13th International ACM
SIGPLAN Symposium on Principles and Practice of
Declarative Programming (PPDP 2011), pp. 149-160,
Odense, Denmark, July 2011. ACM Press.
[PDF]
Automating Derivations of Abstract Machines from
Reduction Semantics: A Generic Formalization of
Refocusing in Coq.
Filip Sieczkowski,
Małgorzata Biernacka, and Dariusz Biernacki.
In
J. Hage and M. T. Morazan, editors, Proceedings of
the 22nd Symposium on Implementation and Application of
Functional Languages (IFL 2010), pp. 72-88, Alphen
aan den Rijn, The Netherlands, September 2010. LNCS
6647, 2011. Springer.
[PDF]
[Coq development]
A Systematic Derivation of the STG Machine Verified in
Coq.
Maciej Piróg and Dariusz Biernacki.
In
J. Gibbons, editor, Proceedings of the 3rd ACM Haskell
Symposium (Haskell 2010), pp. 25-36, Baltimore, MD,
September 2010. ACM Press.
[PDF]
[Coq
development]
Context-based Proofs of Termination for Typed
Delimited-Control Operators.
Małgorzata
Biernacka and Dariusz Biernacki.
In A. Porto and
F. J. López-Fraguas, editors, Proceedings of the 11th
International ACM SIGPLAN Symposium on Principles and
Practice of Declarative Programming (PPDP 2009),
pp. 289-300, Coimbra, Portugal, September 2009. ACM
Press.
[PDF]
A Context-based Approach to Proving Termination of
Evaluation.
Małgorzata Biernacka and Dariusz
Biernacki.
In S. Abramsky, M. Mislove and
C. Palamidessi, editors,
Proceedings of the 25th Conference on the Mathematical
Foundations of Programming Semantics (MFPS 25),
pp. 169-192, Oxford, UK, April 2009. ENTCS 249, 2009.
[PDF]
Clock-directed Modular Code Generation for Synchronous
Data-Flow Languages.
Dariusz Biernacki,
Jean-Louis Colaço, Gregoire Hammon, and Marc Pouzet.
In K. Flautner and J. Regehr, editors, Proceedings of
the 2008 ACM SIGPLAN-SIGBED Conference on Languages,
Compilers, and Tools for Embedded Systems (LCTES
2008), pp. 121-130, Tucson, AZ, June 2008. ACM
Press.
[PDF]
Clock-directed Modular Code Generation from Synchronous
Block Diagrams.
Dariusz Biernacki, Jean-Louis
Colaço, and Marc Pouzet.
In P. H. J. Kelly and
K. Hammond, editors, Proceedings of the 2007 Workshop
on Automatic Program Generation for Embedded Systems
(APGES 2007), pp. 12-20, Salzburg, Austria, October
2007.
[PDF]
Formalizing Constructions of Abstract Machines for
Functional Languages in Coq.
Małgorzata
Biernacka and Dariusz Biernacki.
In J. Giesl,
editor, Informal Proceedings of the 7th International
Workshop on Reduction Strategies in Rewriting and
Programming (WRS 2007), pp. 84-99, Paris, France,
June 2007.
[PDF]
On the Static and Dynamic Extents of Delimited
Continuations.
Dariusz Biernacki, Olivier
Danvy, and Chung-chieh Shan.
Science of Computer Programming, 60(3):274-297, 2006.
[PDF]
A Simple Proof of a Folklore Theorem about Delimited
Control.
Dariusz Biernacki and Olivier Danvy.
Journal of Functional Programming,
vol. 16(3):269-280, 2006. Theoretical Pearl.
[PDF]
An Operational Foundation for Delimited Continuations
in the CPS Hierarchy.
Małgorzata Biernacka,
Dariusz Biernacki, and Olivier Danvy.
Logical Methods in Computer Science, 1 (2:5):1-39,
2005.
[PDF]
On the Dynamic Extent of Delimited
Continuations.
Dariusz Biernacki, Olivier Danvy,
and Chung-chieh Shan.
Information Processing Letters, 6(1):7-17,
2005.
[PDF]
An Operational Foundation for Delimited
Continuations.
Małgorzata Biernacka, Dariusz
Biernacki, and Olivier Danvy.
In H. Thielecke,
editor,
Proceedings of the 4th ACM SIGPLAN Workshop on
Continuations (CW'04), pp. 25-33, Venice, Italy,
January 2004. Technical report CSR-04-1, Department of
Computer Science, Queen Mary's College, 2004.
[PDF]
From Interpreter to Logic Engine by
Defunctionalization.
Dariusz Biernacki and
Olivier Danvy.
In M. Bruynooghe,
editor, Proceedings of the 13th International
Symposium on Logic Based Program Synthesis and
Transformation (LOPSTR 2003), pp. 141-159, Uppsala,
Sweden, August 2003. LNCS 3018,
2004. Springer-Verlag.
[PDF]
A Functional Correspondence between Evaluators and
Abstract Machines.
Mads Sig Ager, Dariusz
Biernacki, Olivier Danvy, and Jan Midtgaard.
In
D. Miller, editor, Proceedings of the 5th ACM-SIGPLAN
International Conference on Principles and Practice of
Declarative Programming (PPDP 2003), pp. 8-19,
Uppsala, Sweden, August 2003. ACM Press.
[PDF]
|