Using Polyvariant Union-Free Flow Analysis to Compile aHigher-Order Functional-Programming Language with aFirst-Class Derivative Operator to Efficient Fortran-like Code
暂无分享,去创建一个
[1] A. Church. The calculi of lambda-conversion , 1941 .
[2] R. E. Wengert,et al. A simple automatic derivative evaluation program , 1964, Commun. ACM.
[3] Gerald Jay Sussman,et al. Lambda: The Ultimate Imperative , 1976 .
[4] B. Speelpenning. Compiling Fast Partial Derivatives of Functions Given by Algorithms , 1980 .
[5] Olin Shivers,et al. Control flow analysis in scheme , 1988, PLDI '88.
[6] Philip Wadler,et al. Comprehending monads , 1990, Mathematical Structures in Computer Science.
[7] Christian Bischof,et al. Adifor 2.0: automatic differentiation of Fortran 77 programs , 1996 .
[8] C. Bendtsen. FADBAD, a flexible C++ package for automatic differentiation - using the forward and backward method , 1996 .
[9] Dafydd Gibbon,et al. 1 User’s guide , 1998 .
[10] Flemming Nielson,et al. Principles of Program Analysis , 1999, Springer Berlin Heidelberg.
[11] Jerzy Karczmarczuk. Functional Differentiation of Computer Programs , 2001, High. Order Symb. Comput..
[12] Gerald J. Sussman,et al. Structure and interpretation of classical mechanics , 2001 .
[13] Laurent Hascoët,et al. TAPENADE 2.1 user's guide , 2004 .
[14] Uwe Naumann,et al. A differentiation-enabled Fortran 95 compiler , 2005, TOMS.
[15] Barak A. Pearlmutter,et al. First-class nonstandard interpretations by opening closures , 2007, POPL '07.