List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Positive focusing is directly useful | 2026-04-02 | Paper |
| Factorize factorization (edit) | 2026-03-23 | Paper |
| Semantic bounds and multi types, revisited | 2026-02-19 | Paper |
| IMELL cut elimination with linear overhead | 2026-01-14 | Paper |
| Mirroring call-by-need, or values acting silly | 2026-01-14 | Paper |
| Reasonable space for the -calculus, logarithmically Logical Methods in Computer Science | 2025-01-31 | Paper |
| Reasonable space for the \(\lambda \)-calculus, logarithmically | 2024-12-06 | Paper |
| Exponentials as substitutions and the cost of cut elimination in linear logic | 2024-12-06 | Paper |
| Formalizing functions as processes | 2024-11-26 | Paper |
| Light genericity | 2024-10-30 | Paper |
| Strong call-by-value and multi types | 2024-09-13 | Paper |
| Factorization and normalization, essentially | 2024-04-19 | Paper |
| Useful Open Call-By-Need (available as arXiv preprint) | 2024-04-10 | Paper |
| Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic Logical Methods in Computer Science | 2024-01-16 | Paper |
| Types by need Programming Languages and Systems | 2023-11-24 | Paper |
| Types of fireballs Programming Languages and Systems | 2023-08-02 | Paper |
| The Negligible and Yet Subtle Cost of Pattern Matching Programming Languages and Systems | 2022-12-09 | Paper |
| Implementing open call-by-value (available as arXiv preprint) | 2022-11-04 | Paper |
| A Fresh Look at the λ-Calculus | 2022-07-18 | Paper |
| Functional pearl: the distributive \(\lambda\)-calculus (available as arXiv preprint) | 2021-07-06 | Paper |
| scientific article; zbMATH DE number 7356671 (Why is no real title available?) | 2021-06-08 | Paper |
| Evaluating functions as processes | 2021-05-05 | Paper |
| Evaluating functions as processes (available as arXiv preprint) | 2021-05-05 | Paper |
| Tight typings and split bounds, fully developed Journal of Functional Programming | 2020-09-09 | Paper |
| An abstract factorization theorem for explicit substitutions | 2020-05-27 | Paper |
| On the invariance of the unitary cost model for head reduction (available as arXiv preprint) | 2020-05-27 | Paper |
| (In)efficiency and reasonable cost models | 2019-11-12 | Paper |
| Types by Need (Extended Version) | 2019-02-15 | Paper |
| Proof nets and the linear substitution calculus (available as arXiv preprint) | 2018-11-23 | Paper |
| Beta reduction is invariant, indeed Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| On the Relative Usefulness of Fireballs 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| On the value of variables Information and Computation | 2017-09-04 | Paper |
| Compressing polarized boxes 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| Linear Logic and Strong Normalization | 2017-02-01 | Paper |
| Open call-by-value Programming Languages and Systems | 2016-12-21 | Paper |
| Open call-by-value Programming Languages and Systems | 2016-12-21 | Paper |
| Distilling abstract machines Proceedings of the 19th ACM SIGPLAN international conference on Functional programming | 2016-09-29 | Paper |
| The useful MAM, a reasonable implementation of the strong \(\lambda\)-calculus Logic, Language, Information, and Computation | 2016-09-09 | Paper |
| (Leftmost-outermost) beta reduction is invariant, indeed Logical Methods in Computer Science | 2016-03-11 | Paper |
| A strong distillery Programming Languages and Systems | 2016-01-08 | Paper |
| Proof nets and the call-by-value \(\lambda\)-calculus Theoretical Computer Science | 2015-12-08 | Paper |
| On the value of variables Logic, Language, Information, and Computation | 2015-01-13 | Paper |
| A nonstandard standardization theorem Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages | 2014-04-10 | Paper |
| Proof pearl: Abella formalization of \(\lambda \)-calculus cube property Certified Programs and Proofs | 2013-04-19 | Paper |
| Call-by-value solvability, revisited Functional and Logic Programming | 2012-07-20 | Paper |
| The permutative \(\lambda \)-calculus Logic for Programming, Artificial Intelligence, and Reasoning | 2012-06-15 | Paper |
| Preservation of strong normalisation modulo permutations for the structural \(\lambda\)-calculus Logical Methods in Computer Science | 2012-04-03 | Paper |
| The structural \(\lambda \)-calculus Computer Science Logic | 2010-09-03 | Paper |
| Jumping Boxes Computer Science Logic | 2009-11-12 | Paper |
Research outcomes over time
This page was built for person: Beniamino Accattoli
