scientific article
From MaRDI portal
Publication:3869322
zbMath0432.03012MaRDI QIDQ3869322
Publication date: 1978
Full work available at URL: https://eudml.org/doc/92085
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
normal formreduction complexityrewriting processweak combinatory logicreduction of applicative combinations of proper combinatorsupper and lower bounds on the length of the reduction
Related Items (2)
Cites Work
- A mathematical logic without variables. I
- Types in combinatory logic
- Abstract computational complexity and cycling computations
- Recursive functions of symbolic expressions and their computation by machine, Part I
- A Machine-Independent Theory of the Complexity of Recursive Functions
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: