An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840)
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 4185580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for reduction sequences in the typed \(\lambda\)-calculus |
scientific article; zbMATH DE number 4185580 |
Statements
An upper bound for reduction sequences in the typed \(\lambda\)-calculus (English)
0 references
1991
0 references
The author produces a simpler and better bound than those obtained previously, for the length of arbitrary reduction sequences of terms of the typed lambda calculus. Some of the concepts used are not defined.
0 references
bounds
0 references
reduction sequences
0 references
typed lambda calculus
0 references
0.9453023
0 references
0 references
0.9013042
0 references
0 references
0.8996715
0 references
