Beta Reduction is Invariant, Indeed (Long Version)


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… (More)


1 Figure or Table