An upper bound for reduction sequences in the typed \(\lambda\)-calculus (Q2639840)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for reduction sequences in the typed \(\lambda\)-calculus |
scientific article |
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
