Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Abstract Machines for Programming Languages: Investigations in Formal Interderivations

2019/33/B/ST6/00289

Keywords:

theory of computation operational semantics abstract machine

Descriptors:

  • ST6_4: Formal methods, foundations of computer science, including theoretical computer science, quantum algorithms

Panel:

ST6 - Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution :

Uniwersytet Wrocławski, Wydział Matematyki i Informatyki

woj.

Other projects carried out by the institution 

Principal investigator (from the host institution):

prof. Witold Charatonik 

Number of co-investigators in the project: 7

Call: OPUS 17 - announced on 2019-03-15

Amount awarded: 634 440 PLN

Project start date (Y-m-d): 2020-02-20

Project end date (Y-m-d): 2024-09-19

Project duration:: 55 months (the same as in the proposal)

Project status: Project completed

Project description

Download the project description in a pdf file

Note - project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

  • Publication in academic press/journals (3)
  • Articles in post-conference publications (16)
  1. A General Fine-Grained Reduction Theory for Effect Handlers
    Authors:
    Filip Sieczkowski and Mateusz Pyzik and Dariusz Biernacki
    Academic press:
    Proceedings of the ACM on Programming Languages (PACMPL) (rok: 2023, tom: 7, Issue ICFP, strony: 511--540), Wydawca: Association for Computing Machinery New York, NY, United States
    Status:
    Published
    DOI:
    10.1145/3607848 - link to the publication
  2. A simple and efficient implementation of strong call by need by an abstract machine
    Authors:
    Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
    Academic press:
    Proceedings of the ACM on Programming Languages (PACMPL) (rok: 2022, tom: 6, strony: 109--136), Wydawca: ACM
    Status:
    Published
    DOI:
    10.1145/3549822 - link to the publication
  3. A simple and efficient implementation of strong call by need by an abstract machine
    Authors:
    Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
    Academic press:
    Proceedings of the ACM on Programming Languages (PACMPL) (rok: 2022, tom: 6, strony: 109--136), Wydawca: ACM
    Status:
    Published
    DOI:
    10.1145/3549822 - link to the publication
  1. A Derived Reasonable Abstract Machine for Strong Call by Value
    Authors:
    Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
    Conference:
    23rd International Symposium on Principles and Practice of Declarative Programming (rok: 2021, tom: PPDP 2021, strony: 6:1--6:14), Wydawca: ACM
    Data:
    konferencja September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479401 - link to the publication
  2. An Abstract Machine for Strong Call by Value
    Authors:
    Małgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
    Conference:
    Asian Symposium on Programming Languages and Systems (rok: 2020, tom: Asian Symposium on Programming, strony: 147--166), Wydawca: Springer
    Data:
    konferencja November 30 - December 2, 2020
    Status:
    Published
    DOI:
    10.1007/978-3-030-64437-6_8 - link to the publication
  3. Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines
    Authors:
    Maciej Buszka, Dariusz Biernacki
    Conference:
    Logic-Based Program Synthesis and Transformation (rok: 2021, tom: LOPSTR 2021, strony: 38--59), Wydawca: Springer
    Data:
    konferencja September 7-8, 2021
    Status:
    Published
    DOI:
    10.1007/978-3-030-98869-2_3 - link to the publication
  4. An Abstract Machine for Strong Call by Value
    Authors:
    Małgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
    Conference:
    Asian Symposium on Programming Languages and Systems (rok: 2020, tom: Asian Symposium on Programming, strony: 147--166), Wydawca: Springer
    Data:
    konferencja November 30 - December 2, 2020
    Status:
    Published
    DOI:
    10.1007/978-3-030-64437-6_8 - link to the publication
  5. A Derived Reasonable Abstract Machine for Strong Call by Value
    Authors:
    Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
    Conference:
    23rd International Symposium on Principles and Practice of Declarative Programming (rok: 2021, tom: PPDP 2021, strony: 6:1--6:14), Wydawca: ACM
    Data:
    konferencja September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479401 - link to the publication
  6. Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines
    Authors:
    Maciej Buszka, Dariusz Biernacki
    Conference:
    Logic-Based Program Synthesis and Transformation (rok: 2021, tom: LOPSTR 2021, strony: 38--59), Wydawca: Springer
    Data:
    konferencja September 7-8, 2021
    Status:
    Published
    DOI:
    10.1007/978-3-030-98869-2_3 - link to the publication
  7. Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory
    Authors:
    Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski
    Conference:
    23rd International Symposium on Principles and Practice of Declarative Programming (rok: 2021, tom: PPDP 2021, strony: 4:1--4:13), Wydawca: ACM
    Data:
    konferencja September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479399 - link to the publication
  8. Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory
    Authors:
    Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski
    Conference:
    23rd International Symposium on Principles and Practice of Declarative Programming (rok: 2021, tom: PPDP 2021, strony: 4:1--4:13), Wydawca: ACM
    Data:
    konferencja September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479399 - link to the publication
  9. Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory
    Authors:
    Dariusz Biernacki, Mateusz Pyzik, Filip Sieczkowski
    Conference:
    23rd International Symposium on Principles and Practice of Declarative Programming (rok: 2021, tom: PPDP 2021, strony: 4:1--4:13), Wydawca: ACM
    Data:
    konferencja September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479399 - link to the publication
  10. Non-Deterministic Abstract Machines
    Authors:
    Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet,Alan Schmitt
    Conference:
    33rd International Conference on Concurrency Theory (CONCUR 2022) (rok: 2022, tom: 33rd International Conference on Concurrency Theory (CONCUR 2022), strony: 7:1-7:24), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Data:
    konferencja September 12-16, 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CONCUR.2022.7 - link to the publication
  11. A Derived Reasonable Abstract Machine for Strong Call by Value
    Authors:
    Malgorzata Biernacka, Witold Charatonik, Tomasz Drab
    Conference:
    23rd International Symposium on Principles and Practice of Declarative Programming (rok: 2021, tom: PPDP 2021, strony: 6:1--6:14), Wydawca: ACM
    Data:
    konferencja September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479401 - link to the publication
  12. An Abstract Machine for Strong Call by Value
    Authors:
    Małgorzata Biernacka, Dariusz Biernacki, Witold Charatonik, Tomasz Drab
    Conference:
    Asian Symposium on Programming Languages and Systems (rok: 2020, tom: Asian Symposium on Programming, strony: 147--166), Wydawca: Springer
    Data:
    konferencja November 30 - December 2, 2020
    Status:
    Published
    DOI:
    10.1007/978-3-030-64437-6_8 - link to the publication
  13. The Zoo of Lambda-Calculus Reduction Strategies, And Coq
    Authors:
    Małgorzata Biernacka, Witold Charatonik, Tomasz Drab
    Conference:
    13th International Conference on Interactive Theorem Proving, ITP (rok: 2022, tom: 13th International Conference on Interactive Theorem Proving, ITP, strony: 7:1--7:19), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    Data:
    konferencja August 7-10, 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ITP.2022.7 - link to the publication
  14. The Zoo of Lambda-Calculus Reduction Strategies, And Coq
    Authors:
    Małgorzata Biernacka, Witold Charatonik, Tomasz Drab
    Conference:
    13th International Conference on Interactive Theorem Proving, ITP (rok: 2022, tom: 13th International Conference on Interactive Theorem Proving, ITP, strony: 7:1--7:19), Wydawca: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    Data:
    konferencja August 7-10, 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ITP.2022.7 - link to the publication
  15. Automating the Functional Correspondence Between Higher-Order Evaluators and Abstract Machines
    Authors:
    Maciej Buszka, Dariusz Biernacki
    Conference:
    Logic-Based Program Synthesis and Transformation (rok: 2021, tom: LOPSTR 2021, strony: 38--59), Wydawca: Springer
    Data:
    konferencja September 7-8, 2021
    Status:
    Published
    DOI:
    10.1007/978-3-030-98869-2_3 - link to the publication
  16. Non-Deterministic Abstract Machines
    Authors:
    Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet,Alan Schmitt
    Conference:
    33rd International Conference on Concurrency Theory (CONCUR 2022) (rok: 2022, tom: 33rd International Conference on Concurrency Theory (CONCUR 2022), strony: 7:1-7:24), Wydawca: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Data:
    konferencja September 12-16, 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CONCUR.2022.7 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy