Ilościowe aspekty złożoności obliczeniowej w rachunku lambda
Instytucja Finansująca / Przyznający: NCN
Tytuł: Ilościowe aspekty złożoności obliczeniowej w rachunku lambda
Kierownik: Maciej Bendkowski
Rozpoczęcie: 2017-03-14
Zakończenie: 2020-03-13
Uwagi: PRELUDIUM 11
| Publikacje |
|---|
| Maciej Bendkowski, Olivier Bodini, Sergey Dovgal, Polynomial tuning of multiparametric combinatorial samplers, (2018), "2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)", Society for Industrial and Applied Mathematics (SIAM) |
| Maciej Bendkowski, Pierre Lescanne, Counting Environments and Closures vol. Leibniz International Proceedings in Informatics (LIPIcs) (2018), "3rd International Conference on Formal Structures for Computation and Deduction (FSCD 2018)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| Maciej Bendkowski, Pierre Lescanne, Combinatorics of explicit substitutions vol. PPDP '18 (2018), "Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming", Association for Computing Machinery (ACM) |
| Maciej Bendkowski, Towards the average-case analysis of substitution resolution in λ-calculus vol. Leibniz International Proceedings in Informatics (LIPIcs) (2019), "4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019)", Schloss Dagstuhl – Leibniz-Zentrum für Informatik |
| Maciej Bendkowski, Olivier Bodini, Sergey Dovgal, Statistical Properties of Lambda Terms, Electronic Journal of Combinatorics vol. 26, Issue 4 (2019), 70 |
| Maciej Bendkowski, Pierre Lescanne, On the enumeration of closures and environments with an application to random generation, Logical Methods in Computer Science vol. 15, Issue 4 (2019), 3:1–3:21 |