Completeness of type assignment in continuous lambda models (Q792995)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Completeness of type assignment in continuous lambda models |
scientific article; zbMATH DE number 3855062
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Completeness of type assignment in continuous lambda models |
scientific article; zbMATH DE number 3855062 |
Statements
Completeness of type assignment in continuous lambda models (English)
0 references
1984
0 references
The completeness of Curry's rules for assigning type schemes to terms of the pure lambda calculus is proved with respect to the model \(P_{\omega}\). An extension of Curry's system in which type schemes can be assigned to the fixed point combinator is introduced, together with a notion of type semantics, for which it is proved sound and complete. Also in this case completeness is proved with respect to the model \(P_{\omega}\).
0 references
type assignment
0 references
continuous lambda models
0 references
completeness
0 references
lambda calculus
0 references
