Theoretical Computer Science
Lambda-calculus, types and models
Lambda-calculus, types and models
Coherent Banach spaces: a continuous denotational semantics
Theoretical Computer Science - Special issue on linear logic, 1
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Theoretical Computer Science - Logic, language, information and computation
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Theoretical Computer Science
Term Collections in λ and ρ-calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Differential Linear Logic and Polarization
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Mathematical Structures in Computer Science
Parallel Reduction in Resource Lambda-Calculus
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A Concurrent Model for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Differential structure in models of multiplicative biadditive intuitionistic linear logic
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
On linear combinations of λ-terms
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
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
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
Complexity of strongly normalising λ-terms via non-idempotent intersection types
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
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
Constructing differential categories and deconstructing categories of games
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
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
Mathematical models of computational and combinatorial structures
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Solvability in resource lambda-calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
∂ for Data: Differentiating Data Structures
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A Simply Typed λ-Calculus of Forward Automatic Differentiation
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructing differential categories and deconstructing categories of games
Information and Computation
A language for differentiable functions
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Probabilistic coherence spaces are fully abstract for probabilistic PCF
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 5.23 |
We present an extension of the lambda-calculus with differential constructions. We state and prove some basic results (confluence, strong normalization in the typed case), and also a theorem relating the usual Taylor series of analysis to the linear head reduction of lambda-calculus.