Taylor expansion, finiteness and strategies

DOI10.1016/J.ENTCS.2019.09.005OpenAlexW2996151753WikidataQ113317358 ScholiaQ113317358MaRDI QIDQ2133165FDOQ2133165

Authors: Jules Chouquet 

Publication date: 29 April 2022

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

Recommendations

• Uniformity and the Taylor expansion of ordinary lambda-terms
• Taylor expansion, \(\beta\)-reduction and normalization
• Strong normalizability as a finiteness structure via the Taylor expansion of \(\lambda\)-terms
• scientific article; zbMATH DE number 7089070
• A characterization of the Taylor expansion of \(\lambda\)-terms

zbMATH Keywords

linear logicPCFlambda calculusTaylor expansioncall-by-needcall-by-valuebang calculus

Mathematics Subject Classification ID

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

Cites Work

• LCF considered as a programming language
• Execution time of λ-terms via denotational semantics and intersection types
• Uniformity and the Taylor expansion of ordinary lambda-terms
• The differential lambda-calculus
• Normal functors, power series and \(\lambda\)-calculus
• Probabilistic coherence spaces as a model of higher-order probabilistic computation
• Finiteness spaces
• The algebraic lambda calculus
• Strong normalizability as a finiteness structure via the Taylor expansion of \(\lambda\)-terms
• Call-by-push-value: Decomposing call-by-value and call-by-name
• Reasoning about call-by-need by means of types
• Collapsing non-idempotent intersection types
• The bang calculus and the two Girard's translations
• Weighted relational models of typed lambda-calculi
• Classical by-need
• Full abstraction for probabilistic PCF
• Transport of finiteness structures and applications
• Mackey-complete spaces and power series -- a topological model of differential linear logic
• Probabilistic call by push value
• Title not available (Why is that?)
• On the Taylor expansion of probabilistic λ-terms
• Taylor expansion, \(\beta\)-reduction and normalization
• The concurrent game semantics of probabilistic PCF
• Species, profunctors and Taylor expansion weighted by SMCC. A unified framework for modelling nondeterministic, probabilistic and quantum programs

Cited In (1)

• Resource approximation for the \(\lambda \mu \)-calculus

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

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