Type Preorders and Recursive Terms

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.

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science 2005-07, Vol.136, p.3-21
Main Authors: Alessi, Fabio, Dezani-Ciancaglini, Mariangiola
Format: Article
Language:English
Subjects:
easy terms
fixed points
intersection types
λ-models
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1571-0661
1571-0661
DOI:10.1016/j.entcs.2005.06.017