Abstract Machines for Programming Languages: Investigations in Formal Interderivations

2019/33/B/ST6/00289

Keywords

Descriptors

  • ST6_004: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna, algorytmy kwantowe

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

Voivodeship: dolnośląskie

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
2020-02-20
Project end date
2024-09-19
Project duration
55 months (the same as in the proposal)
Project status
Project settled

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)

  1. Fully Abstract Encodings of -Calculus in HOcore through Abstract Machines

    Authors:
    Malgorzata Biernacka, Dariusz Biernacki, Serguei Lenglet, Piotr Polesiuk, Damien Pous and Alan Schmitt
    Academic press:
    Log. Methods Comput. Sci. (year: 2024, volume: 20(3), pages: 3:1-3:45), Publisher: Logical Methods in Computer Science e.V.
    Status:
    Published
    DOI:
    10.46298/lmcs-20(3:3)2024 – link to the publication
  2. 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) (year: 2023, volume: 7, Issue ICFP, pages: 511--540), Publisher: Association for Computing Machinery New York, NY, United States
    Status:
    Published
    DOI:
    10.1145/3607848 – 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) (year: 2022, volume: 6, pages: 109--136), Publisher: ACM
    Status:
    Published
    DOI:
    10.1145/3549822 – link to the publication

Articles in post-conference publications (7)

  1. Optimizing a Non-Deterministic Abstract Machine with Environments

    Authors:
    Malgorzata Biernacka, Dariusz Biernacki, Serguei Lenglet and Alan Schmitt
    Conference:
    9th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2024, July 10-13, 2024, Tallinn, Estonia (year: 2024, volume: 9th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2024, pages: 11:1--11:22), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference July 10-13, 2024
    Status:
    Published
    DOI:
    10.4230/LIPIcs.FSCD.2024.11 – link to the publication
  2. Non-Deterministic Abstract Machines

    Authors:
    Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet,Alan Schmitt
    Conference:
    33rd International Conference on Concurrency Theory (CONCUR 2022) (year: 2022, volume: 33rd International Conference on Concurrency Theory (CONCUR 2022), pages: 7:1-7:24), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference September 12-16, 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CONCUR.2022.7 – link to the publication
  3. 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 (year: 2021, volume: PPDP 2021, pages: 4:1--4:13), Publisher: ACM
    Date:
    conference September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479399 – link to the publication
  4. 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 (year: 2022, volume: 13th International Conference on Interactive Theorem Proving, ITP, pages: 7:1--7:19), Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
    Date:
    conference August 7-10, 2022
    Status:
    Published
    DOI:
    10.4230/LIPIcs.ITP.2022.7 – link to the publication
  5. 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 (year: 2020, volume: Asian Symposium on Programming, pages: 147--166), Publisher: Springer
    Date:
    conference November 30 - December 2, 2020
    Status:
    Published
    DOI:
    10.1007/978-3-030-64437-6_8 – 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 (year: 2021, volume: LOPSTR 2021, pages: 38--59), Publisher: Springer
    Date:
    conference September 7-8, 2021
    Status:
    Published
    DOI:
    10.1007/978-3-030-98869-2_3 – link to the publication
  7. 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 (year: 2021, volume: PPDP 2021, pages: 6:1--6:14), Publisher: ACM
    Date:
    conference September 6-8, 2021
    Status:
    Published
    DOI:
    10.1145/3479394.3479401 – link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski