Theoretical Computer Science
Lambda-calculus, types and models
Lambda-calculus, types and models
Nondeterministic extensions of untyped &lgr;-calculus
Information and Computation
Polarized proof-nets and λµ-calculus
Theoretical Computer Science
Free Deduction: An Analysis of "Computations" in Classical Logic
Proceedings of the First Russian Conference on Logic Programming
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
The differential Lambda-calculus
Theoretical Computer Science
On Köthe sequence spaces and linear logic
Mathematical Structures in Computer Science
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Separation with Streams in the ?µ-calculus
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
Differential Linear Logic and Polarization
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Mathematical Structures in Computer Science
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
The separation theorem for differential interaction nets
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
On linear combinations of λ-terms
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Intuitionistic differential nets and lambda-calculus
Theoretical Computer Science
| Hi-index | 5.23 |
We define a differential @l@m-calculus which is an extension of both Parigot's @l@m-calculus and Ehrhard-Regnier's differential @l-calculus. We prove some basic properties of the system: reduction enjoys Church-Rosser and simply typed terms are strongly normalizing.