Taylor expansion, finiteness and strategies

DOI10.1016/j.entcs.2019.09.005OpenAlexW2996151753WikidataQ113317358 ScholiaQ113317358MaRDI QIDQ2133165

Jules Chouquet

Publication date: 29 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.09.005

zbMATH Keywords

linear logicTaylor expansionlambda calculusPCFcall-by-needcall-by-valuebang calculus

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Call-by-push-value: Decomposing call-by-value and call-by-name
• Uniformity and the Taylor expansion of ordinary lambda-terms
• Normal functors, power series and \(\lambda\)-calculus
• LCF considered as a programming language
• The differential lambda-calculus
• Classical By-Need
• Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms
• Reasoning About Call-by-need by Means of Types
• The algebraic lambda calculus
• Full Abstraction for Probabilistic PCF
• Transport of finiteness structures and applications
• Execution time of λ-terms via denotational semantics and intersection types
• Mackey-complete spaces and power series – a topological model of differential linear logic
• On the Taylor expansion of probabilistic λ-terms
• Taylor expansion, β-reduction and normalization
• The concurrent game semantics of Probabilistic PCF
• Species, Profunctors and Taylor Expansion Weighted by SMCC
• Weighted Relational Models of Typed Lambda-Calculi
• Finiteness spaces

This page was built for publication: Taylor expansion, finiteness and strategies