|The differential lambda-calculus |
Auteur(s): Ehrhard Thomas, Regnier Laurent
(Article) Publié: Theoretical Computer Science, vol. 309 p.1-41 (2003)
Ref HAL: hal-00150572_v1
Exporter : BibTex | endNote
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.
Commentaires: 41 pages