2021
Autores
Alves, S; Iglésias, J;
Publicação
CoRR
Abstract
2021
Autores
Alves, S; Fernández, M; Ramos, M;
Publicação
CoRR
Abstract
2016
Autores
Sá, J; Alves, S; Broda, S;
Publicação
CoRR
Abstract
2023
Autores
Alves, S; Kesner, D; Ramos, M;
Publicação
LOGIC, LANGUAGE, INFORMATION, AND COMPUTATION, WOLLIC 2023
Abstract
We show that recent approaches to static analysis based on quantitative typing systems can be extended to programming languages with global state. More precisely, we define a call-by-value language equipped with operations to access a global memory, together with a semantic model based on a (tight) multi-type system that captures exact measures of time and space related to evaluation of programs. We show that the type system is quantitatively sound and complete with respect to the operational semantics of the language.
2024
Autores
Alves, S; Kesner, D; Ramos, M;
Publicação
Programming Languages and Systems - 22nd Asian Symposium, APLAS 2024, Kyoto, Japan, October 22-24, 2024, Proceedings
Abstract
We show how (well-established) type systems based on non-idempotent intersection types can be extended to characterize termination properties of functional programming languages with pattern matching features. To model such programming languages, we use a (weak and closed) ?-calculus integrating a pattern matching mechanism on algebraic data types (ADTs). Remarkably, we also show that this language not only encodes Plotkin’s CBV and CBN ?-calculus as well as other subsuming frameworks, such as the bang-calculus, but can also be used to interpret the semantics of effectful languages with exceptions. After a thorough study of the untyped language, we introduce a type system based on intersection types, and we show through purely logical methods that the set of terminating terms of the language corresponds exactly to that of well-typed terms. Moreover, by considering non-idempotent intersection types, this characterization turns out to be quantitative, i.e. the size of the type derivation of a term t gives an upper bound for the number of evaluation steps from t to its normal form. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
2024
Autores
Alves, S; Mackie, I;
Publicação
CoRR
Abstract
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.