In this paper we introduce a notion of ldquorelevancerdquo for type assignment systems including intersection types. We define a relevant system which is an extension of a particular rank 2 intersection system and of the polymorphic type discipline limited to rank 2. We study some of its properties and finally state the decidability of type inference providing an algorithm which is sound and complete.
A Decidable Intersection Type System based on Relevance
DAMIANI, Ferruccio;GIANNINI, Paola
1994-01-01
Abstract
In this paper we introduce a notion of ldquorelevancerdquo for type assignment systems including intersection types. We define a relevant system which is an extension of a particular rank 2 intersection system and of the polymorphic type discipline limited to rank 2. We study some of its properties and finally state the decidability of type inference providing an algorithm which is sound and complete.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
tacs94.pdf
Accesso riservato
Descrizione: Articolo principale (conferenza)
Tipo di file:
PDF EDITORIALE
Dimensione
548.24 kB
Formato
Adobe PDF
|
548.24 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
