4 citations · 11 across the 11 of their papers we have counts for
4 papers · 1 filter
Linear Rank Intersection Types
Fábio Reis, Sandra Alves, Mário Florido
Non-idempotent intersection types provide quantitative information about typed programs, and have been used to obtain time and space complexity measures. Intersection type systems…
Execution Time Program Verification With Tight Bounds
Ana Carolina Silva, Manuel Barbosa, Mario Florido
This paper presents a proof system for reasoning about execution time bounds for a core imperative programming language. Proof systems are defined for three different scenarios: ap…
Typed SLD-Resolution: Dynamic Typing for Logic Programming
João Barbosa, Mário Florido, Vítor Santos Costa
The semantic foundations for logic programming are usually separated into two different approaches. The operational semantics, which uses SLD-resolution, the proof method that comp…
Structural Rules and Algebraic Properties of Intersection Types
Sandra Alves, Mário Florido
In this paper we define several notions of term expansion, used to define terms with less sharing, but with the same computational properties of terms typable in an intersection ty…