We define a type and effect system for a λ-calculus extended with side effects, in the form of primitives for creating and accessing resources. The analysis correctly over-approximates the sequences of resource accesses performed by a program at run-time. To accurately analyse the binding between the creation of a resource and its accesses, our system exploits a new class of types. Our ν-types have the form νN. τ ⊳ H, where the names in N are bound both in the type τ and in the effect H, that represents the sequences of resource accesses
We present the first algorithm for reconstructing the types and effects of expressions in the presen...
We propose a typed call-by-name λ-calculus with shift, reset and strict functions and describe its l...
Binding-time analysis is important in partial evaluators. Its task is to determine which parts of a ...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
In this paper we investigate the λ -calculus, a λ-calculus enriched with resource control. Explicit ...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
Several type systems have been proposed for characterizing resource usage in process calculi, starti...
1 Scientific Activity Static analysis allows to formally prove properties of programs without having...
We present a new static system that reconstructs the types, regions and effects of expressions in an...
The λ-calculus is a programming model based on functions. Its Turing-completeness comes from the fre...
Side-effect are ubiquitous in programming. Examples include mutable state, exceptions, non-determini...
Type-preserving translations are effective rigorous tools in the study of core programming calculi. ...
International audienceWe present λ , a calculus with special constructions for dealing with effects ...
Type-and-effect systems are a powerful tool for program construction and verification. We describe i...
We present the first algorithm for reconstructing the types and effects of expressions in the presen...
We propose a typed call-by-name λ-calculus with shift, reset and strict functions and describe its l...
Binding-time analysis is important in partial evaluators. Its task is to determine which parts of a ...
An extension of the $\lambda$-calculus is proposed, to study resource usage analysis and verificat...
Abstract. We propose a type-based resource usage analysis for the πcalculus extended with resource c...
In this paper we investigate the λ -calculus, a λ-calculus enriched with resource control. Explicit ...
An extension of the λ-calculus is proposed, to study resource usage analysis and verification. It fe...
Several type systems have been proposed for characterizing resource usage in process calculi, starti...
1 Scientific Activity Static analysis allows to formally prove properties of programs without having...
We present a new static system that reconstructs the types, regions and effects of expressions in an...
The λ-calculus is a programming model based on functions. Its Turing-completeness comes from the fre...
Side-effect are ubiquitous in programming. Examples include mutable state, exceptions, non-determini...
Type-preserving translations are effective rigorous tools in the study of core programming calculi. ...
International audienceWe present λ , a calculus with special constructions for dealing with effects ...
Type-and-effect systems are a powerful tool for program construction and verification. We describe i...
We present the first algorithm for reconstructing the types and effects of expressions in the presen...
We propose a typed call-by-name λ-calculus with shift, reset and strict functions and describe its l...
Binding-time analysis is important in partial evaluators. Its task is to determine which parts of a ...