A Simply Typed λ-Calculus of Forward Automatic Differentiation
暂无分享,去创建一个
[1] A. Kock. Strong functors and monoidal monads , 1972 .
[2] Barak A. Pearlmutter,et al. Using Polyvariant Union-Free Flow Analysis to Compile aHigher-Order Functional-Programming Language with aFirst-Class Derivative Operator to Efficient Fortran-like Code , 2008 .
[3] Richard Blute,et al. CARTESIAN DIFFERENTIAL CATEGORIES , 2009 .
[4] Barak A. Pearlmutter,et al. Reverse-mode AD in a functional framework: Lambda the ultimate backpropagator , 2008, TOPL.
[5] A. Kock. Monads on symmetric monoidal closed categories , 1970 .
[6] Barak A. Pearlmutter,et al. Nesting forward-mode AD in a functional framework , 2008, High. Order Symb. Comput..
[7] Thomas Ehrhard,et al. A convenient differential category , 2010, ArXiv.
[8] Antonio Bucciarelli,et al. Categorical Models for Simply Typed Resource Calculi , 2010, MFPS.
[9] Amey Karkare,et al. Heap reference analysis using access graphs , 2006, ACM Trans. Program. Lang. Syst..
[10] Laurent Regnier,et al. The differential lambda-calculus , 2003, Theor. Comput. Sci..
[11] Eugenio Moggi,et al. Notions of Computation and Monads , 1991, Inf. Comput..