Modelling an Ammonium Transporter with SCLS ∗ (2010)
Ferruccio Damiani, Elena Grassi, Mike Guether, Angelo Troina
The Stochastic Calculus of Looping Sequences (SCLS) is a recently proposed modelling language for the representation and simulation of biological systems behaviour. It has been designed with the aim...
Modelling an Ammonium Transporter with SCLS (2009)
Coppo, Mario, Damiani, Ferruccio, Grassi, Elena, Guether, Mike, Troina, Angelo
The Stochastic Calculus of Looping Sequences (SCLS) is a recently proposed modelling language for the representation and simulation of biological systems behaviour. It has been designed with the aim...
Modelling an Ammonium Transporter with SCLS (2009)
Mario Coppo, Ferruccio Damiani, Elena Grassi, Mike Guether, Angelo Troina
The Stochastic Calculus of Looping Sequences (SCLS) is a recently proposed modelling language for the representation and simulation of biological systems behaviour. It has been designed with the aim...
On Polymorphic Recursion, Type Systems, and Abstract Interpretation (2008)
Marco Comini, Ferruccio Damiani, Samuel Vrech
Abstract. The problem of typing polymorphic recursion (i.e., recursive function definitions rec {x = e} where different occurrences of x in e are used with different types) has been investigated both...
IOS Press Rank 2 Intersection for Recursive Definitions (2008)
Abstract. Let ⊢ be an intersection type system. We say that a term is ⊢-simple (or just simple when the system ⊢ is clear from the context) if system ⊢ can prove that it has a simple type. In...
2. IMPLEMENTING STATE CLASSES 3. PARAMETERIZED STATES 4. THE SANTA CLAUS PROBLEM (2008)
Ferruccio Damiani, Nick Cameron, Sophia Drossopoulou, Elena Giachino, Paola Giannini
Up to now state classes NOT promising in sequential programming promising for coordination EOS, Genova, January 9-10, 2006 – p. Up to now state classes NOT promising in sequential programming...
Dottorato di Ricerca in Informatica (2008)
Ferruccio Damiani, Promotor Prof, Co-promotor Dott, Paola Giannini, A Carmen
functional programs
IOS Press Rank-2 intersection for recursive definitions (2008)
Abstract. Let ⊢ be an intersection type system. We say that a term is ⊢-simple (or just simple when the system ⊢ is clear from the context) if system ⊢ can prove that it has a simple type. In...
Alias types for “environment-aware” (2008)
Ferruccio Damiani, Torino Italia, Paola Giannini, Università Del Piemonte Orientale, Alessandria Italia
Rank 2 Intersection Types for Modules (Version with conclusions and appendices of [11]) (2008)
We propose a rank 2 intersection type system for a language of modules built on a core ML-like language. The principal typing property of the rank 2 intersection type system for the core language...
Algorithms, Languages, Theory (2007)
(Version with conclusions and appendices of [11]) We propose a rank 2 intersection type system for a language of modules built on a core ML-like language. The principal typing property of the rank 2...
Sophia Drossopoulou, Ferruccio Damiani, Mariangiola Dezani-ciancaglini, Paola Giannini
Abstract. Re-classication changes at run-time the class membership of an object while retaining its identity. We suggest language features for object re-classication, which could extend an...
Sophia Drossopoulou, Ferruccio Damiani, Mariangiola Dezani-ciancaglini, Paola Giannini
Abstract. Re-classication changes at run-time the class membership of an object while retaining its identity. We suggest language features for object re-classication, which could extend an...
Alias types for "environment-aware" computations (2007)
Ferruccio Damiani, Torino Italia, Paola Giannini, Alessandria Italia
In previous work with Bono we introduced a calculus for modelling "environmentaware " computations, that is computations that adapt their behavior according to the capabilities of...
Strictness, Totality, and Non-Standard Type (2007)
Inference Mario Coppo, Ferruccio Damiani, Paola Giannini
In this paper we present two non-standard type inference systems for conjunctive strictness and totality analyses of higher-order typed functional programs and prove completeness results for both the...
Re-classification and Multi-threading: Fickle_MT (2007)
Ferruccio Damiani, Mariangiola Dezani-Ciancaglini, Paola Giannini
Ferruccio Damiani + Universit a di Torino Corso Svizzera 185 damiani@di.unito.it Mariangiola Dezani-Ciancaglini # Universit a di Torino Corso Svizzera 185 dezani@di.unito.it Paola Giannini Universit...
Separating Type, Behavior, and State to Achieve Very Fine-grained Reuse (2007)
Viviana Bono, Ferruccio Damiani, Elena Giachino
Abstract. Recently, Schärli et al. pointed out that both single and multiple class-based inheritance are often inappropriate as a reuse mechanism, because classes play two competing roles, namely, a...
Separating Type, Behavior, and State to Achieve Very Fine-grained Reuse (2007)
Viviana Bono, Ferruccio Damiani, Elena Giachino
Abstract. Recently, Schärli et al. pointed out that both single and multiple class-based inheritance are often inappropriate as a reuse mechanism, because classes play two competing roles, namely, a...
On state classes and their dynamic semantics (2006)
Ferruccio Damiani, Elena Giachino, Paola Giannini, Emanuele Cazzola
Abstract: We introduce state classes, a construct to program objects that can be safely concurrently accessed. State classes model the notion of object’s state (intended as some abstraction over...
A State Abstraction for Coordination in Java-like Languages (2006)
Ferruccio Damiani, Elena Giachino, Paola Giannini, Nick Cameron, Sophia Drossopoulou
Abstract. Objects ’ state, intended as some abstraction over the value of fields, is always in the mind of a COOL (Concurrent Object-Oriented Language) programmer. In fact, as the state of an...
Polymorphic Bytecode: Compositional Compilation for Java-like Languages (2005)
Davide Ancona, Ferruccio Damiani, Sophia Drossopoulou, Elena Zucca
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assumptions are...
Rank-2 Intersection and Polymorphic Recursion (2005)
Let # be a rank-2 intersection type system. We say that a term is #-simple (or just simple when the system # is clear from the context) if system # can prove that it has a simple type. In this paper...
Rank-2 intersection and polymorphic recursion (2005)
Abstract. Let ⊢ be a rank-2 intersection type system. We say that a term is ⊢-simple (or just simple when the system ⊢ is clear from the context) if system ⊢ can prove that it has a simple...
Rank-2 intersection and polymorphic recursion (2005)
Abstract. Let ⊢ be a rank-2 intersection type system. We say that a term is ⊢-simple (or just simple when the system ⊢ is clear from the context) if system ⊢ can prove that it has a simple...
Even more principal typings for Java-like languages (2004)
Davide Ancona, Ferruccio Damiani, Sophia Drossopoulou, Elena Zucca, Disi Università Di Genova
Abstract. We propose a new type system for Java-like languages which allows compilation of a class in isolation, that is, in a context where no information is available on other classes. Indeed, by...
Even More Principal Typings for Java-like Languages (2004)
Davide Ancona Ferruccio, Davide Ancona, Ferruccio Damiani, Sophia Drossopoulou, Elena Zucca, Disi Università Di Genova
We propose a new type system for Java-like languages which allows compilation of a class in isolation, that is, in a context where no information is available on other classes. Indeed, by this type...
On Re-classification and Multi-threading (2004)
Ferruccio Damiani, Mariangiola Dezani-Ciancaglini, Paola Giannini
this paper we consider re-classification in the presence of multi-threading. To this aim we define a multi-threaded extension of the language MT . We define an operational semantics and a type and...
Even More Principal Typings for Java-like Languages (2004)
Davide Ancona, Ferruccio Damiani, Sophia Drossopoulou, Elena Zucca, Disi Università Di Genova
We propose a new type system for Java-like languages which allows compilation of a class in isolation, that is, in a context where no information is available on other classes. Indeed, by this type...
Abstract. We propose new typing rules for assigning rank 2 intersection types to (possibly mutually) recursive definitions. A major achievement of the new rules over previous proposals is that they...
Rank 2 Intersection Types for Modules (2003)
We propose a rank 2 intersection type system for a language of modules built on a core ML-like language. The principal typing property of the rank 2 intersection type system for the core language...
Refined Effects for Unanticipated Object Re-classification: Fickle_3 (Extended Abstract) (2003)
Ferruccio Damiani, Sophia Drossopoulou, Paola Giannini
In previous work on the language Fickle and its extension Fickle_II Dezani and us introduced language features for object re-classification for imperative, typed, class-based, object-oriented...
Abstract. We propose new typing rules for assigning rank 2 intersection types to (possibly mutually) recursive definitions. A major achievement of the new rules over previous proposals is that they...
A Calculus for "environment-Aware" Computation (2002)
Viviana Bono, Ferruccio Damiani, Paola Giannini
We present a calculus for modelling "environment-aware" computations, that is computations that adapt their behaviour according to the capabilities of the environment. The calculus is an...
The TkInter homepage. http://www.python.org/topics/tkinter (2001)
Ferruccio Damiani, Paola Giannini
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and complete way, by reducing...
Refined Effects for Reclassification: Fickle_III (2001)
Ferruccio Damiani, Mariangiola Dezani-Ciancaglini, Università Di Torino, Sophia Drossopoulou, Paola Giannini, Università Del Piemonte Orientale
This paper is organized as follows: In Section 2 we introduce III informally using an example. In Sections 3, 4, and 5 we outline III : the syntax, operational semantics, typing rules, and we state...
Type-based useless-code elimination for functional programs (2000)
Stefano Berardi, Ferruccio Damiani, Paola Giannini
Abstract. In this paper we present a survey of the work on type-based useless-code elimination for higher-order functional programs. After some historical remarks on the motivations and early...
Objects Dynamically Changing Class (1999)
Sophia Drossopoulou, Mariangiola Dezani-ciancaglini, Ferruccio Damiani, Paola Giannini
We suggest language features that allow objects to mutate, i.e. change their class membership at run-time. These features could extend an imperative, typed, class-based, object-oriented language like...
On Traits and Types in a Java-like Setting (1970)
Viviana Bono, Ferruccio Damiani, Elena Giachino
Both single and multiple class-based inheritance are often inappropriate as a reuse mechanism, because classes play two competing roles. Namely, a class is both a generator of instances and a unit of...