We study the problem of type-checking functional programs in three extensions of ML. One distinguishing feature of these extensions is that they allow recursive definitions to be polymorphicallyâ€¦ (More)

We embed the standard Î»-calculus, denoted Î›, into two larger Î»-calculi, denoted Î›âˆ§ and &Î›âˆ§. The standard notion of Î²-reduction for Î› corresponds to two new notions of reduction, Î²âˆ§ for Î›âˆ§ and &Î²âˆ§ forâ€¦ (More)

Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding aâ€¦ (More)

Principality of typings is the property that for each typable term, there is a typing from which all other typings are obtained via some set of operations. Type inference is the problem of finding aâ€¦ (More)

The Ambient Calculus was developed by Cardelli and Gordon as a formal framework to study issues of mobility and migrant code [CG98]. We consider an Ambient Calculus where ambients transport andâ€¦ (More)

We investigate finite-rank intersection type systems, analyzing the complexity of their type inference problems and their relation to the problem of recognizing semantically equivalent terms.â€¦ (More)

We carry out an analysis of typability of terms in ML. Our main result is that this problem is DEXPTIME-hard, where by DEXPTIME we mean DTIME(2<supscrpt>n</supscrpt><supscrpt>0(1)</supscrpt>). This,â€¦ (More)