We propose a general, powerful framework of type systems for the -calculus, and show that we can obtain as its instances a variety of type systems guaranteeing non-trivial propert...
We introduce a dynamic logic that is enriched by non-rigid functions, i.e., functions that may change their value from state to state (during program execution), and we present a (...
Affine type systems manage resources by preventing some values from being used more than once. This offers expressiveness and performance benefits, but difficulty arises in intera...
In recent years it has become clear that techniques developed for concurrent programming are in fact very useful for the analysis of complex systems in biology. To some level of i...
Vinod A. Muganthan, Andrew Phillips, Maria Grazia ...
Abstract. An extension of the λ-calculus is proposed, to study historybased access control. It allows for security policies with a possibly nested, local scope. We define a type ...
Massimo Bartoletti, Pierpaolo Degano, Gian Luigi F...