Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Type preorders and recursive terms Fabio Alessi 1

Summary: Type preorders and recursive terms
Fabio Alessi 1
Dipartimento di Matematica e Informatica
Universita degli Studi di Udine
Via delle Scienze 208, 33100 Udine (Italy)
Mariangiola Dezani-Ciancaglini 2;3
Dipartimento di Informatica
Universita degli Studi di Torino
corso Svizzera 185, 10149 Torino (Italy)
Research Report UDMI/11/2004/RR
We show how to use intersection types for building models of a -calculus enriched
with recursive terms, whose intended meaning is of minimal xed points. As a
by-product we prove an interesting consistency result.
1. Introduction
Intersection types were introduced in the late 70's by Coppo and Dezani [7,8,5],
to overcome the limitations of Curry's type discipline. They are a very expres-
sive type language which allows to describe and capture various properties of
-terms. For instance, they have been used in Pottinger [20] to give the rst
type theoretic characterisation of strongly normalizable terms and in Coppo et


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


Collections: Computer Technologies and Information Sciences