Parallel beta reduction is not elementary recursive
type: Item
instance of: scholarly article
title: Parallel beta reduction is not elementary recursive
zbMATH Open document ID: 1005.68037
author: Andrea Asperti
author: Harry G. Mairson
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68N18
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1853204
MaRDI profile type: Publication
full work available at URL: inco.2001.2869
OpenAlex ID: W2007147248
cites work: Q4327828
cites work: Q5397484
cites work: Paths, computations and labels in the \(\lambda\)-calculus
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Q4385524
cites work: The Calculi of Lambda Conversion. (AM-6)
cites work: Q4138187
cites work: Q4198056
cites work: Q4722037
cites work: Q3709853
cites work: Q3862379
cites work: Q5843849
cites work: Q4842976
cites work: Optimality and inefficiency: what isn't a cost model of the lambda calculus?
cites work: On global dynamics of optimal graph reduction
cites work: A simple proof of a theorem of Statman
cites work: Q4133967
cites work: Q4319642
cites work: Q3322086
cites work: The typed lambda-calculus is not elementary recursive
DOI: 10.1006/INCO.2001.2869
description: scientific article; zbMATH DE number 1853204