Quantitative aspects of computational complexity in lambda calculus

2016/21/N/ST6/01032

Keywords

Descriptors

  • ST6_4: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna
  • ST1_1: Logika i podstawy matematyki

Panel

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

Host institution

Uniwersytet Jagielloński, Wydział Matematyki i Informatyki

Voivodeship: małopolskie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr Maciej Maria Bendkowski

Number of co-investigators in the project: 3

Call

PRELUDIUM 11 – announced on 2016-03-15

Amount awarded
98 400 PLN
Project start date
2017-03-14
Project end date
2020-03-13
Project duration
36 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. Statistical Properties of Lambda Terms

    Authors:
    Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
    Academic press:
    Electronic Journal of Combinatorics (year: 2019, volume: 26, pages: 1--70), Publisher: nie dotyczy
    Status:
    Published
    DOI:
    10.37236/8491 – link to the publication
  2. On the enumeration of closures and environments with an application to random generation

    Authors:
    Maciej Bendkowski, Pierre Lescanne
    Academic press:
    Logical Methods in Computer Science (year: 2019, volume: 15, pages: 3:1--3:21), Publisher: nie dotyczy
    Status:
    Published
    DOI:
    10.23638/LMCS-15(4:3)2019 – link to the publication
  3. Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers

    Authors:
    Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
    Status:
    Accepted for publication

Articles in post-conference publications (4)

  1. Towards the average-case analysis of substitution resolution in lambda-calculus

    Authors:
    Maciej Bendkowski
    Conference:
    4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019) (year: 2019, pages: 7:1--7:21), Publisher: Leibniz International Proceedings in Informatics (LIPIcs) (2019)
    Date:
    conference 24-30.06.2019
    Status:
    Published
  2. Combinatorics of Explicit Substitutions

    Authors:
    Maciej Bendkowski, Pierre Lescanne
    Conference:
    20th International Symposium on Principles and Practice of Declarative Programming (year: 2018, pages: 7:1--7:12), Publisher: ACM
    Date:
    conference 03.09.2018-05.09.2018
    Status:
    Published
  3. Polynomial tuning of multiparametric combinatorial samplers

    Authors:
    Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
    Conference:
    Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (year: 2018, pages: 92-106), Publisher: Society for Industrial and Applied Mathematics (SIAM)
    Date:
    conference 08-09.01.2018
    Status:
    Published
  4. Counting Environments and Closures

    Authors:
    Maciej Bendkowski, Pierre Lescanne
    Conference:
    Third International Conference on Formal Structures for Computation and Deduction (year: 2018, pages: 46035), Publisher: Leibniz International Proceedings in Informatics
    Date:
    conference 09-12.07.2018
    Status:
    Published

« New search

Graphic design and implementation: Jakub Piotrowski