Copyright © 2019 for this paper by its authors. We present a type and effect system for tracing and preventing sharing and mutation in imperative languages. That is, on one hand, the type system traces sharing possibly introduced by the evaluation of an expression, so that uniqueness and immutability properties can be easily detected. On the other hand, sharing and mutation can be prevented by type qualifiers which forbid some actions. Sharing is directly represented at the syntactic level as a relation among free variables, thanks to the fact that in the underlying calculus memory is encoded in terms
We present a static type discipline on an extension of lambda-calculus with threads and shared memor...
We present a method for providing semantic interpretations for languages with a type system featurin...
Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eage...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
We outline a type and effect system which infers sharing possibly introduced by the evaluation of an...
In type-and-coeffect systems, contexts are enriched by coeffects modeling how they are actually used...
We present an imperative object calculus where types are annotated with qualifiers for aliasing and ...
Pawns is a programming language under development that supports algebraic data types, polymorphism, ...
Abstract. We integrate existential types into a strongly typed C-like language. In particular, we sh...
We present a method for providing semantic interpretations for languages with a type system featurin...
Type-and-effect systems are a powerful tool for program construction and verification. We describe i...
It can be difficult to write safe concurrent programs which use shared mutable state. Subtle mistake...
Two imperative programming language phrases interfere when one writes to a storage variable that the...
In "Syntactic Control of Interference" (POPL, 1978), J. C. Reynolds proposes three design ...
We present a static type discipline on an extension of lambda-calculus with threads and shared memor...
We present a method for providing semantic interpretations for languages with a type system featurin...
Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eage...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
We introduce a type and effect system, for an imperative object calculus, which infers sharing possi...
We outline a type and effect system which infers sharing possibly introduced by the evaluation of an...
In type-and-coeffect systems, contexts are enriched by coeffects modeling how they are actually used...
We present an imperative object calculus where types are annotated with qualifiers for aliasing and ...
Pawns is a programming language under development that supports algebraic data types, polymorphism, ...
Abstract. We integrate existential types into a strongly typed C-like language. In particular, we sh...
We present a method for providing semantic interpretations for languages with a type system featurin...
Type-and-effect systems are a powerful tool for program construction and verification. We describe i...
It can be difficult to write safe concurrent programs which use shared mutable state. Subtle mistake...
Two imperative programming language phrases interfere when one writes to a storage variable that the...
In "Syntactic Control of Interference" (POPL, 1978), J. C. Reynolds proposes three design ...
We present a static type discipline on an extension of lambda-calculus with threads and shared memor...
We present a method for providing semantic interpretations for languages with a type system featurin...
Abstract: We present a sharing analysis for the functional language Safe. This is a first-order eage...