Projects funded by the NCN


Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Quantitative aspects of computational complexity in lambda calculus

2016/21/N/ST6/01032

Keywords:

lambda calculus combinatorics

Descriptors:

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

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

woj. małopolskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Maciej 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 (Y-m-d): 2017-03-14

Project end date (Y-m-d): 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)
  • Articles in post-conference publications (4)
  1. Statistical Properties of Lambda Terms
    Authors:
    Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
    Academic press:
    Electronic Journal of Combinatorics (rok: 2019, tom: 26, strony: 1--70), Wydawca: nie dotyczy
    Status:
    Published
    DOI:
    10.37236/8491 - link to the publication
  2. Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
    Authors:
    Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
    Academic press:
    Combinatorics, Probability and Computing (rok: 2021, ), Wydawca: Cambridge University Press
    Status:
    Accepted for publication
  3. 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 (rok: 2019, tom: 15, strony: 3:1--3:21), Wydawca: nie dotyczy
    Status:
    Published
    DOI:
    10.23638/LMCS-15(4:3)2019 - link to the publication
  1. Polynomial tuning of multiparametric combinatorial samplers
    Authors:
    Maciej Bendkowski, Olivier Bodini, Sergey Dovgal
    Conference:
    Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (rok: 2018, ), Wydawca: Society for Industrial and Applied Mathematics (SIAM)
    Data:
    konferencja 08-09.01.2018
    Status:
    Published
  2. Combinatorics of Explicit Substitutions
    Authors:
    Maciej Bendkowski, Pierre Lescanne
    Conference:
    20th International Symposium on Principles and Practice of Declarative Programming (rok: 2018, ), Wydawca: ACM
    Data:
    konferencja 03.09.2018-05.09.2018
    Status:
    Published
  3. Counting Environments and Closures
    Authors:
    Maciej Bendkowski, Pierre Lescanne
    Conference:
    Third International Conference on Formal Structures for Computation and Deduction (rok: 2018, ), Wydawca: Leibniz International Proceedings in Informatics
    Data:
    konferencja 09-12.07.2018
    Status:
    Published
  4. 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) (rok: 2019, ), Wydawca: Leibniz International Proceedings in Informatics (LIPIcs) (2019)
    Data:
    konferencja 24-30.06.2019
    Status:
    Published