Revisiting call-by-value Böhm trees in light of their Taylor expansion

MaRDI QIDQ3300796zbMATH OpenFDO

Authors Emma Kerinec, Giulio Manzonetto, Michele Pagani

Publication date 30 July 2020

Full work available at URL https://arxiv.org/abs/1809.02659, https://lmcs.episciences.org/6638

zbMATH Keywords

lambda calculusTaylor expansioncall-by-valueprogram approximationdifferential linear logicBöhm trees

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• On the Taylor expansion of \(\lambda\)-terms and the groupoid structure of their rigid approximants
• Logical Approaches to Computational Barriers
• Uniformity and the Taylor expansion of ordinary lambda-terms
• Böhm's theorem for resource lambda calculus through Taylor expansion
• On the Taylor expansion of probabilistic λ-terms

Cites work

• scientific article; zbMATH DE number 5852776 (Why is no real title available?)
• scientific article; zbMATH DE number 3889501 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 1330448 (Why is no real title available?)
• scientific article; zbMATH DE number 2044494 (Why is no real title available?)
• scientific article; zbMATH DE number 6825409 (Why is no real title available?)
• A Semantical and Operational Account of Call-by-Value Solvability
• A characterization of the Taylor expansion of \(\lambda\)-terms
• A global representation of the recursive functions in the \(\lambda\)- calculus
• An equivalence between lambda- terms
• Böhm's theorem for resource lambda calculus through Taylor expansion
• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Call-by-value Solvability
• Collapsing non-idempotent intersection types
• Efficient self-interpretation in lambda calculus
• Logical Approaches to Computational Barriers
• New semantical insights into call-by-value \(\lambda\)-calculus
• Open call-by-value
• Parametric \(\lambda \)-theories
• The differential lambda-calculus
• The parametric lambda calculus. A metamodel for computation.
• Uniformity and the Taylor expansion of ordinary lambda-terms

Cited in

(5)

• scientific article; zbMATH DE number 7566060 (Why is no real title available?)
• Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
• Light genericity
• Resource approximation for the \(\lambda \mu \)-calculus
• On the Taylor expansion of probabilistic λ-terms

This page was built for publication: Revisiting call-by-value Böhm trees in light of their Taylor expansion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300796)