| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9655870 | Electronic Notes in Theoretical Computer Science | 2005 | 19 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Fabio Alessi, Mariangiola Dezani-Ciancaglini,