(Leftmost-Outermost) Beta Reduction is Invariant, Indeed
نویسندگان
چکیده
منابع مشابه
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed
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 o...
متن کامل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 completely machine-independent and based...
متن کاملLeftmost Outermost Revisited
We present an elementary proof of the classical result that the leftmost outermost strategy is normalizing for left-normal orthogonal rewrite systems. Our proof is local and extends to hyper-normalization and weakly orthogonal systems. Based on the new proof, we study basic normalization, i.e., we study normalization if the set of considered starting terms is restricted to basic terms. This all...
متن کاملLinear Depth Increase of Lambda Terms in Leftmost-Outermost Beta-Reduction Rewrite Sequences
Accattoli and Dal Lago have recently proved that the number of steps in a leftmost-outermost β-reduction rewrite sequence to normal form provides an invariant cost model for the Lambda Calculus. They sketch how to implement leftmost-outermost rewrite sequences on a reasonable machine, with a polynomial overhead, by using simulating rewrite sequences in the linear explicit substitution calculus....
متن کاملProving the Genericity Lemma by Leftmost Reduction is Simple
Abst rac t . The Genericity Lemma is one of the most important motivations to take in the untyped lambda calculus the notion of solvability as a formal representation of the informal notion of undefinedness. We generalise solvability towards typed lambda calculi, and we call this generalisation: usability. We then prove the Genericity Lemma for un-usable terms. The technique of the proof is bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2016
ISSN: 1860-5974
DOI: 10.2168/lmcs-12(1:4)2016