(Leftmost-Outermost) Beta Reduction is Invariant, Indeed

@article{Accattoli2016LeftmostOutermostBR,
  title={(Leftmost-Outermost) Beta Reduction is Invariant, Indeed},
  author={Beniamino Accattoli and Ugo Dal Lago},
  journal={Logical Methods in Computer Science},
  year={2016},
  volume={12}
}

• Beniamino Accattoli, Ugo Dal Lago
• Published 2016 in Logical Methods in Computer Science
• DOI:10.2168/LMCS-12(1:4)2016

Slot and van Emde Boas’ weak invariance thesis states that reasonable machines can simulate each other within a polynomial overhead in time. Is λ-calculus a reasonable machine? Is there a way to measure the computational complexity of a λ-term? This paper presents the first complete positive answer to this long-standing problem. Moreover, our answer is completely machine-independent and based on a standard notion in the theory of λ-calculus: the length of a leftmost-outermost derivation to… CONTINUE READING

Save

Watch Paper

Cite

View on ArXiv