The differential lambda-calculus

Thomas Ehrhard, Laurent Regnier
2003 Theoretical Computer Science  
We present an extension of the lambda-calculus with di erential constructions. We state and prove some basic results (con uence, 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.
doi:10.1016/s0304-3975(03)00392-x fatcat:4cbn3lmgnjefhcp7ogdau22ml4