Revisiting call-by-value Böhm trees in light of their Taylor expansion
From MaRDI portal
Publication:3300796
Authors: Emma Kerinec, Giulio Manzonetto, Michele Pagani 
Publication date: 30 July 2020
Full work available at URL: https://arxiv.org/abs/1809.02659
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
lambda calculusTaylor expansioncall-by-valueprogram approximationdifferential linear logicBöhm trees
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logical Approaches to Computational Barriers
- The parametric lambda calculus. A metamodel for computation.
- Uniformity and the Taylor expansion of ordinary lambda-terms
- The differential lambda-calculus
- A characterization of the Taylor expansion of \(\lambda\)-terms
- Böhm's theorem for resource lambda calculus through Taylor expansion
- Title not available (Why is that?)
- Efficient self-interpretation in lambda calculus
- An equivalence between lambda- terms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Call-by-value Solvability
- A global representation of the recursive functions in the \(\lambda\)- calculus
- A Semantical and Operational Account of Call-by-Value Solvability
- Parametric \(\lambda \)-theories
- Open call-by-value
- Collapsing non-idempotent intersection types
- New semantical insights into call-by-value \(\lambda\)-calculus
- Title not available (Why is that?)
Cited In (5)
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)
