Sciweavers

441 search results - page 5 / 89
» Session Types = Intersection Types Union Types
Sort
View
ICFP
2004
ACM
14 years 5 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
ENTCS
2002
66views more  ENTCS 2002»
13 years 5 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...
Steffen van Bakel
NDJFL
2002
74views more  NDJFL 2002»
13 years 5 months ago
The Semantics of Entailment Omega
This paper discusses the relation between the minimal positive relevant logic B+ and intersection and union type theories. There is a marvellous coincidence between these very diff...
Mariangiola Dezani-Ciancaglini, Robert K. Meyer, Y...
COORDINATION
2008
Springer
13 years 7 months ago
How to Infer Finite Session Types in a Calculus of Services and Sessions
Abstract. The notion of session is fundamental in service oriented applications, as it separates interactions between different instances of the same service, and it groups togethe...
Leonardo Gaetano Mezzina
LICS
2007
IEEE
13 years 11 months ago
Strong Normalization as Safe Interaction
When enriching the λ-calculus with rewriting, union types may be needed to type all strongly normalizing terms. However, with rewriting, the elimination rule (∨ E) of union typ...
Colin Riba