Using programming language theory to make automatic differentiation sound and efficient

Lecture Notes in Computational Science and Engineering

Volumn 64 LNCSE, Issue , 2008, Pages 79-90

  Pearlmutter, Barak A ^a   Siskind, Jeffrey Mark ^b  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Forward mode; Lambda calculus; Multiple transformation; Nesting; Optimization

Indexed keywords

FORWARD MODE; LAMBDA CALCULUS; MULTIPLE TRANSFORMATION; NESTING; OPTIMIZATION;

AUTOMATIC PROGRAMMING; CALCULATIONS; CODES (SYMBOLS); COMPUTER PROGRAMMING LANGUAGES; LINGUISTICS; MATHEMATICAL TECHNIQUES; PROGRAM COMPILERS; PROGRAMMING THEORY;

DIFFERENTIATION (CALCULUS);

EID: 59349087586     PISSN: 14397358     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-68942-3_8     Document Type: Conference Paper

References (11)

1. Church, A.: The Calculi of Lambda Conversion. Princeton University Press, Princeton, NJ (1941)
2. Hascoët, L., Pascual, V.: TAPENADE 2.1 user's guide. Rapport technique 300, INRIA, Sophia Antipolis (2004). URL http://www.inria.fr/rrrt/rt- 0300.html
3. Hughes, J.: Why functional programming matters. The Computer Journal 32(2), 98-107 (1989). URL http://www.md.chalmers.se/~rjmh/Papers/whyfp. html
4. Johnsson, T.: Lambda lifting: Transforming programs to recursive equations. In: Functional Programming Languages and Computer Architecture. Springer-Verlag, Nancy, France (1985)
5. Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer-Verlag, New York (1999)
6. Pearlmutter, B.A., Siskind, J.M.: Reverse-mode AD in a functional framework: Lambda the ultimate backpropagator. ACM Trans. on Programming Languages and Systems (2008). In press
7. Siskind, J.M., Pearlmutter, B.A.: First-class nonstandard interpretations by opening closures. In: Proceedings of the 2007 Symposium on Principles of Programming Languages, pp. 71-6. Nice, France (2007)
8. Siskind, J.M., Pearlmutter, B.A.: Nesting forward-mode AD in a functional framework. Higher-Order and Symbolic Computation (2008). To appear
9. Siskind, J.M., Pearlmutter, B.A.: Putting the automatic back into AD: Part I, What's wrong. Tech. Rep. TR-ECE-08-02, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA (2008). URL ftp://ftp.ecn.purdue.edu/qobi/TR-ECE-08-02.pdf
10. Siskind, J.M., Pearlmutter, B.A.: Using polyvariant union-free flow analysis to compile a higher-order functional-programming language with a first-class derivative operator to efficient Fortran-like code. Tech. Rep. TR-ECE-08-01, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA (2008). URL http://docs.lib.purdue.edu/ecetr/367/
11. Wadler, P.L.: Comprehending monads. In: Proceedings of the 1990 ACM Conference on LISP and Functional Programming, pp. 61-78. Nice, France (1990)