The study of type isomorphisms for different -calculi started over twenty years ago, and a very wide body of knowledge has been established, both in terms of results and in terms o...
Mariangiola Dezani-Ciancaglini, Roberto Di Cosmo, ...
Building complex component-based software architectures can lead to subtle assemblage errors. In this paper, we introduce a typesystem-based approach to avoid message handling err...
Michael Lienhardt, Alan Schmitt, Jean-Bernard Stef...
We study a type system equipped with universal types and equirecursive types, which we refer to as F?. We show that type equality may be decided in time O(n log n), an improvement...
Abstract. This paper proposes two typing systems for session interactions in higherorder mobile processes. Session types for the HOπ-calculus capture high-level structures nicatio...
Abstract. Weakly-typed languages such as Cobol often force programrepresent distinct data abstractions using the same low-level physical type. In this paper, we describe a techniqu...