scientific article
From MaRDI portal
Publication:3300796
Michele Pagani, Emma Kerinec, Giulio Manzonetto
Publication date: 30 July 2020
Full work available at URL: https://arxiv.org/abs/1809.02659
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Taylor expansionlambda calculusBöhm treescall-by-valueprogram approximationdifferential linear logic
Related Items (3)
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications ⋮ Unnamed Item ⋮ On the Taylor expansion of probabilistic λ-terms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The parametric lambda calculus. A metamodel for computation.
- Parametric \(\lambda \)-theories
- Uniformity and the Taylor expansion of ordinary lambda-terms
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- A global representation of the recursive functions in the \(\lambda\)- calculus
- An equivalence between 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
- Open Call-by-Value
- Efficient self-interpretation in lambda calculus
- Call-by-value Solvability
- New Semantical Insights Into Call-by-Value λ-Calculus
- A Semantical and Operational Account of Call-by-Value Solvability
- Logical Approaches to Computational Barriers
This page was built for publication:
