Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Filter Models and Easy Terms ? F.Alessi 1 , M. Dezani-Ciancaglini 2 , F. Honsell 1
 

Summary: Filter Models and Easy Terms ?
F.Alessi 1 , M. Dezani-Ciancaglini 2 , F. Honsell 1
1 Dipartimento di Matematica ed Informatica, Universita di Udine,
Via delle Scienze 208, 33100 Udine, Italy
falessi, honsellg@dimi.uniud.it
2 Dipartimento di Informatica, Universita di Torino,
Corso Svizzera 185, 10149 Torino, Italy
dezani@di.unito.it
Abstract. We illustrate the use of intersection types as a tool for syn-
thesizing -models which exhibit special purpose features. We focus on
semantical proofs of easiness. This allows us to prove that the class of
-theories induced by graph models is strictly included in the class of
-theories induced by non-extensional lter models.
Introduction
Intersection types were introduced in the late 70's by Dezani and Coppo [10, 12,
6], to overcome the limitations of Curry's type discipline. They are a very ex-
pressive type language which allows to describe and capture various properties of
-terms. For instance, they have been used in [29] to give the rst type theoretic
characterization of strongly normalizable terms and in [13] to capture persistently
normalizing terms and normalizing terms. See [15] for a more complete account

  

Source: Alessi, Fabio - Dipartimento di Matematica e Informatica, UniversitÓ degli Studi di Udine
Torino, UniversitÓ di - Dipartimento di Informatica

 

Collections: Computer Technologies and Information Sciences