Collaborators: Ugo Dal Lago, Delia Kesner, Damiano Mazza, and Claudio Sacerdoti Coen.The COCA HOLA project aims at developing complexity analyses of higher-order computations, i.e. that approach to computation where the inputs and outputs of a program are not simply numbers, strings, or compound data-types, but programs themselves. The focus is not on analysing fixed programs, but whole programming languages. The aim is the identification of adequate units of measurement for time and space, i.e. what are called reasonable cost models. The problem is non-trivial because the evaluation of higher-order languages is defined abstractly, via high-level operations, leaving the implementation unspecified. Concretely, the project will analyse different implementation schemes, measuring precisely their computational complexity with respect to the number of high-level operations, and eventually develop more efficient new ones. The goal is to obtain a complexity-aware theory of implementations of higher-order languages with both theoretical and practical downfalls.The projects stems from recent advances on the theory of time cost models for the lambda-calculus, the computational model behind the higher-order approach, obtained by the principal investigator and his collaborators (who are included in the project).COCA HOLA will span over three years and is organised around three work packages, essentially: - extending the current results to encompass realistic languages;
- explore the gap between positive and negative results in the literature;
- use ideas from linear logic to explore
*space*cost models, about which almost nothing is known.
The project proposal is available here. Note that the ANR did not fund all the demanded resources, in particular it did not fund the postdoc scholarship. |