Beta reduction is invariant, indeed

DOI10.1145/2603088.2603105zbMath1394.03020arXiv1405.3311OpenAlexW2010239186MaRDI QIDQ4635589

Ugo Dal Lago, Beniamino Accattoli

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.3311

zbMATH Keywords

computational complexity\(\lambda\)-calculusexplicit substitutionssharingcost models

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Related Items (8)

On sharing, memoization, and polynomial time ⋮ On the value of variables ⋮ Proof nets and the call-by-value \(\lambda\)-calculus ⋮ On abstract normalisation beyond neededness ⋮ Polynomial time over the reals with parsimony ⋮ Unnamed Item ⋮ A Fresh Look at the λ-Calculus ⋮ Processes against tests: on defining contextual equivalences

This page was built for publication: Beta reduction is invariant, indeed