Beta Reduction is Invariant, Indeed (Long Version)

  title={Beta Reduction is Invariant, Indeed (Long Version)},
  author={Beniamino Accattoli and Ugo Dal Lago},
Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is l-calculus a reasonable machine? Is there a way to measure the computational complexity of a l-term? This paper presents the first complete positive answer to this long-standing problem. Moreover, our answer is completely machine-independent and based over a standard notion in the theory of l-calculus: the length of a leftmost-outermost derivation to… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 7 times over the past 90 days. VIEW TWEETS