Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Type preorders and recursive terms Fabio Alessi 1
 

Summary: Type preorders and recursive terms
Fabio Alessi 1
Dipartimento di Matematica e Informatica
Universit`a degli Studi di Udine
Via delle Scienze 208, 33100 Udine (Italy)
Mariangiola Dezani-Ciancaglini 2,3
Dipartimento di Informatica
Universit`a degli Studi di Torino
corso Svizzera 185, 10149 Torino (Italy)
Abstract
We show how to use intersection types for building models of a -calculus enriched with
recursive terms, whose intended meaning is of minimal fixed 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 [5,6,3],
to overcome the limitations of Curry's type discipline. They are a very expressive
type language which allows to describe and capture various properties of -terms.
For instance, they have been used in Pottinger [19] to give the first type theoretic
characterisation of strongly normalizable terms and in Coppo et al. [7] to capture
persistently normalising terms and normalising terms. See Dezani et al. [8] for a

  

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