We introduce a theory of behavioural types as a semantic foundation of typed-calculi. In this theory, a type is a set of behaviours, represented by early name passing synchronisation trees, which conform to a certain behavioural constraint. Operations on typed processes are derived from typed variants of well-known process-theoretic operations for mobile processes, and each model of typed-calcu...

This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, case-expressions, seq, and recursive types. The typed language is a subset of the untyped language. Normal-order reduction is defined for the untyped language. Since there are less typed contexts the typed contextual pre...

Many gender differences are thought to result from interactions between inborn factors and sociocognitive processes that occur after birth. There is controversy, however, over the causes of gender-typed preferences for the colors pink and blue, with some viewing these preferences as arising solely from sociocognitive processes of gender development. We evaluated preferences for gender-typed col...

Certain categorial calculi exhibit a property that is known as count invariance (Van Benthem 1986). In these grammars, it is true that if a proposition Y ⇒ z is derivable, the string to the left of ⇒ and the type to its right share the results of a particular way of counting occurrences of basic types. This count protocol discriminates between positive occurences (heads) and negative occurrence...