Extensional Taylor expansion

DOI10.46298/THEORETICS.26.7MaRDI QIDQ7254602zbMATH OpenFDO

Authors Pierre Clairambault, Lionel Vaux Auclair

Publication date 28 May 2026

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/THEORETICS.26.7

zbMATH Keywords

\(\lambda\)-calculusgame semanticsTaylor expansion of \(\lambda\)-terms

Mathematics Subject Classification ID

General logic (03Bxx) Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A General Class of Models of $\mathcal{H}^*$
• A lambda calculus satellite
• Asynchronous games. II: The true concurrency of innocence
• Böhm and Taylor for all!
• Differential interaction nets
• Finiteness spaces
• Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion
• Generalised species of rigid resource terms
• scientific article; zbMATH DE number 3961577 (Why is no real title available?)
• scientific article; zbMATH DE number 3523517 (Why is no real title available?)
• scientific article; zbMATH DE number 3550683 (Why is no real title available?)
• scientific article; zbMATH DE number 3611324 (Why is no real title available?)
• scientific article; zbMATH DE number 7089070 (Why is no real title available?)
• scientific article; zbMATH DE number 7700622 (Why is no real title available?)
• Infinitary lambda calculus
• Innocent game models of untyped -calculus
• Linear logic
• Logical Approaches to Computational Barriers
• Normal functors, power series and -calculus
• Not Enough Points Is Enough
• On full abstraction for PCF: I, II and III
• On the Taylor expansion of -terms and the groupoid structure of their rigid approximants
• On the Taylor expansion of probabilistic λ-terms
• Parallel reductions in \(\lambda\)-calculus
• Plays as resource terms via non-idempotent intersection types
• Probabilistic Böhm trees and probabilistic separation
• Relational graph models, Taylor expansion and extensionality
• Revisiting call-by-value Böhm trees in light of their Taylor expansion
• Strategies as resource terms, and their categorical semantics
• Taylor expansion for Call-By-Push-Value
• Taylor expansion, finiteness and strategies
• The differential lambda-calculus
• Thick Subtrees, Games and Experiments
• Uniformity and the Taylor expansion of ordinary lambda-terms
• What is a categorical model of the differential and the resource \(\lambda \)-calculi?

This page was built for publication: Extensional Taylor expansion

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