“A Differentiation Primitive for Extended Λ–calculus”, 1988-02-01 ():
A symbolic differentiation functional that handles expressions containing free and bound variables in an extended λ-calculus programming language is described.
The differentiation primitive is implemented by augmenting the set of graph-reduction rules that define the evaluation of expressions.
A formalization of partial derivatives of functions with regards to position of parameters is presented.
A comparison is made to other methods of automatic differentiation.