A differentiation primitive for extended &lgr;-calculus

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A differentiation primitive for extended &lgr;-calculus

Full text

Pdf (645 KB)

Source

ACM Annual Computer Science Conference archive
Proceedings of the 1988 ACM sixteenth annual conference on Computer science table of contents

Atlanta, Georgia, United States

Pages: 9 - 16

Year of Publication: 1988

ISBN:0-89791-260-8

Author

Terry Flaherty

Department of Computer Information Systems Applications, City College, Loyola University, New Orleans, LA

Sponsor

ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 4, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/322609.322611 What is a DOI?

ABSTRACT

A symbolic differentiation functional that handles expressions containing free and bound variables in an extended &lgr;-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 wrt position of parameters is presented. A comparison is made to other methods of automatic differentiation.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
	2	Barton, D. and Fitch, J. P. "A Review of Algebraic Manipulation Programs and Their Application," Computer Journal, Vol. 15, 1972.
	3	Brown, W. S., and Hearn, A. C. "Application of Symbolic Mathematical Computations," Computer.. Physics Communications, Vol. 17, 1979.
	4	Terry Wayne Flaherty, An implementation of differentiation as a built-in function for a lambda-calculus graph-reduction machine, Tulane University, New Orleans, LA, 1986
	5	Jeffrey P. Golden, Differentiation of unknown functions in MACSYMA, ACM SIGSAM Bulletin, v.19 n.2, p.19-24, May 1985 [doi>10.1145/1089402.1089405]
	6	van Hulzen, J. A. and Calmet, J. "Computer Algebra Systems," in Computer Algebra: Symbolic and Algebraic Comoua-, ed. Buchberger, B., Collfns, G. E. and Loos, R. Springer, Wien, 1983.
	7	Landin, P. J. "The Mechanical Evaluation of Expressions," Computer Journal, Vol. 6, 1964.
	8	John McCarthy, Recursive functions of symbolic expressions and their computation by machine, Part I, Communications of the ACM, v.3 n.4, p.184-195, April 1960 [doi>10.1145/367177.367199]
	9	Perrot, J-F. "LISP et Lambda-Calcul," in Lambda-Calcul et .Semantiq__ue Formelllle des Lan~a~es de Pro~rammation, Paris, mai, 1~)79.
	10	Rail, L. B. Automatic Differentiation: Techand Applications, Springer- Verlag, Berlin, 1981.
	11	Revesz, G. "An Extension of Lambda-Calculus for Functional Programming," Journal of Logic Programming. Vol. 1, No. 3, 1984:. -
	12	Revesz, G. "Axioms for the theory of lambda-conversion," SIAM J. Comp.ati.n.g, Vol. 14, No. 2, May 1985.
	13	J. M. Shearer , M. A. Wolfe, ALGLIB, a simple symbol-manipulation package, Communications of the ACM, v.28 n.8, p.820-825, Aug. 1985 [doi>10.1145/4021.4023]
	14	Turner, D. A. "A New Implementation Technique for Applicative Languages," Software Practice and Experience, Vol. 9, 1979.
	15	Michael Wester , Stanly Steinberg, An extension to MACSYMA's concept of functional differentiation, ACM SIGSAM Bulletin, v.17 n.3-4, p.25-30, August-November 1983 [doi>10.1145/1089338.1089343]