No label defined (Q4029583)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 139605
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 139605 |
Statements
28 March 1993
0 references
categories withpartial morphisms
0 references
complete objects
0 references
partial computations
0 references
partial retraction systems
0 references
\(PER_ \omega\)
0 references
typed \(\lambda\)-calculus
0 references
0.7305908203125
0 references
[For the entire collection see Zbl 0745.00057.] The aim of this paper is to compare type-structures, i.e., models of typed \(\lambda\)-calculus, when data types are taken to be (possibly structured) countable sets and morphisms to be effective transformations. This will be done by tools related to Friedman's homomorphisms and Plotkin-Statman's logical relations by \textit{H. Friedman} [Lect. Notes Math. 453, 22-37 (1975; Zbl 0311.02040)], \textit{G. Plotkin} [Notes on completeness of the full continuous type hierarchy, Manuscript, Lab. for Comput. Sci., M.I.T. (1982)] and \textit{R. Statman} [Logical relations and typed lambda-calculus, Inform. and Control (1984)].
0 references
