Beta reduction is invariant, indeed

Abstract

Slot and van Emde Boas' weak invariance thesis states that <i>reasonable</i> machines can simulate each other within a polynomially overhead in time. Is &#955;-calculus a reasonable machine? Is there a way to measure the computational complexity of a &#955;-term? This paper presents the first complete positive answer to this long-standing problem. Moreover… (More)
DOI: 10.1145/2603088.2603105

Topics

1 Figure or Table

Statistics

0204060201520162017
Citations per Year

Citation Velocity: 20

Averaging 20 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Accattoli2014BetaRI, title={Beta reduction is invariant, indeed}, author={Beniamino Accattoli and Ugo Dal Lago}, booktitle={CSL-LICS}, year={2014} }