Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657816 | Theoretical Computer Science | 2005 | 37 Pages |
Abstract
The completeness parts of the characterisations are proved uniformly for all the properties, using a set-theoretical semantics of intersection types over suitable kinds of stable sets. This technique generalises Krivine's and Mitchell's methods for strong normalisation to other evaluation properties.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
M. Dezani-Ciancaglini, F. Honsell, Y. Motohama,