Nesting forward-mode AD in a functional framework

DOI10.1007/s10990-008-9037-1zbMath1175.68104OpenAlexW1964298340MaRDI QIDQ1029813

Barak A. Pearlmutter, Jeffrey Mark Siskind

Publication date: 13 July 2009

Published in: Higher-Order and Symbolic Computation (Search for Journal in Brave)

Full work available at URL: http://eprints.maynoothuniversity.ie/10236/1/BP-Nesting-2008.pdf

zbMATH Keywords

functional languagesautomatic differentiationapplicative languagesmultiple transformationreferential transparency

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (12)

On the Versatility of Open Logical Relations ⋮ A Hitchhiker's guide to automatic differentiation ⋮ A Simply Typed λ-Calculus of Forward Automatic Differentiation ⋮ Polynomial Functors Constrained by Regular Expressions ⋮ Zero variance differential geometric Markov chain Monte Carlo algorithms ⋮ Correctness of automatic differentiation via diffeologies and categorical gluing ⋮ Landau: a language for dynamical systems with automatic differentiation ⋮ Reverse AD at higher types: pure, principled and denotationally correct ⋮ Unnamed Item ⋮ Divide-and-conquer checkpointing for arbitrary programs with no user annotation ⋮ Unnamed Item ⋮ Unified form language

Uses Software

• Haskell
• MzScheme

Cites Work

• Unnamed Item
• Generating power of lazy semantics
• Lazy multivariate higher-order forward-mode AD
• Functional automatic differentiation with dirac impulses
• A simple automatic derivative evaluation program
• Functional differentiation of computer programs

This page was built for publication: Nesting forward-mode AD in a functional framework