The system F of variable types, fifteen years later
Theoretical Computer Science
Theoretical Computer Science
Proofs and types
Reversible, irreversible and optimal &lgr;-machines
Theoretical Computer Science - Special issue on linear logic, 1
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
The differential Lambda-calculus
Theoretical Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
Theoretical Computer Science
A call-by-name lambda-calculus machine
Higher-Order and Symbolic Computation
Böhm trees, krivine's machine and the taylor expansion of lambda-terms
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Theoretical Computer Science
Differential Linear Logic and Polarization
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Parallel Reduction in Resource Lambda-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Categorical Models for Simply Typed Resource Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Exponentials with infinite multiplicities
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
A semantic measure of the execution time in linear logic
Theoretical Computer Science
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Realizability proof for normalization of full differential linear logic
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Böhm's theorem for resource lambda calculus through Taylor expansion
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Böhm trees, krivine's machine and the taylor expansion of lambda-terms
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
Solvability in resource lambda-calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Constructing differential categories and deconstructing categories of games
Information and Computation
| Hi-index | 5.24 |
We define the complete Taylor expansion of an ordinary lambda-term as an infinite linear combination-with rational coefficients-of terms of a resource calculus similar to Boudol's lambda-calculus with multiplicities (or with resources). In our resource calculus, all applications are (multi)linear in the algebraic sense, i.e. commute with linear combinations of the function or the argument. We study the collective behaviour of the beta-reducts of the terms occurring in the Taylor expansion of any ordinary lambda-term, using, in a surprisingly crucial way, a uniformity property that they enjoy. As a corollary, we obtain (the main part of) a proof that this Taylor expansion commutes with Bohm tree computation, syntactically.