RELatinG quALIties and quantities by resource Approximation
Qualitative type systems are a widespread technique exploited in the study of programming languages. Types allow to obtain relevant information on the behaviours of programs, such as termination of the evaluation. Quantitative typ...
ver más
¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video
Proyectos interesantes
ARiAT
Advanced Reasoning in Arithmetic Theories
1M€
Cerrado
PolyBar
A new approach to polymorphism through bar recursion
185K€
Cerrado
CONJEXITY
Investigating the Conjectures of Fine-Grained Complexity
1M€
Cerrado
FINABIS
Finite-state abstractions of infinite-state systems
1M€
Cerrado
InfTy
Infinitary Rewriting for Type Systems
200K€
Cerrado
PARAMTIGHT
Parameterized complexity and the search for tight complexity...
1M€
Cerrado
Información proyecto REGALIA
Duración del proyecto: 23 meses
Fecha Inicio: 2024-09-01
Fecha Fin: 2026-08-31
Fecha límite de participación
Sin fecha límite de participación.
Descripción del proyecto
Qualitative type systems are a widespread technique exploited in the study of programming languages. Types allow to obtain relevant information on the behaviours of programs, such as termination of the evaluation. Quantitative type systems are used to achieve additional information on complexity and resource consumption. While these two families of type systems have been deeply studied, their interaction is still far to be properly understood. Given a program typed in a qualitative way, can we extract quantitative information from it in a compositional manner? This very natural and fundamental question has not received any appropriate answer yet. REGALIA aims to answer the question, deepening our understanding of the relationship between these two kinds of type systems. In order to do so, REGALIA will further develop the theory of resource approximation, by extending Girard's approximation theorems to proofs with cuts and by establishing a translation algorithm between qualitative systems and quantitative ones. I shall then exploit these results to define modular methods to study programming languages, alternative to Tait-Girard reducibility, that will offer quantitative interpretation of relevant qualitative systems in the context of both pure and effectful computation.