No label defined (Q3787978)
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 4051568
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4051568 |
Statements
1987
0 references
second-order lambda-calculus
0 references
typed \(\lambda \)-calculus
0 references
0.8128024935722351
0 references
0.7760337591171265
0 references
0.7689453363418579
0 references
This paper is in fact a detailed presentation of a typed \(\lambda\)-calculus denoted by \(F\) and introduced by the author in [Proc. 2nd Scand. Logic Symp. 1970, Stud. Logic Found. Math. 63, 63--92 (1971; Zbl 0221.02013)]. It is a second order language since the abstraction operation is also defined on types. Its syntax is clear and simple and it has other ``nice'' properties (conversion rules and normal forms for terms, good expressive power) which makes it easy to manipulate. The type inference problem seems to be hard, and \(F\) has not yet an operational semantics. Future research also devoted mainly to ultrafilters -- has since appeared [ibid. 127, 521--545 (1988)]. [For the entire collection see Zbl 0627.00006.]
0 references