Show simple item record

dc.contributor.authorNaumann, Uwe
dc.contributor.authorRiehme, Jan
dc.contributor.editorGanzha, M.
dc.identifier.citationNaumann , U & Riehme , J 2007 , An L-Attributed Grammar for Adjoint Code . in M Ganzha (ed.) , Procs of IMCSIT'07 . PTI , pp. 1133-1146 . < >
dc.identifier.otherPURE: 7791845
dc.identifier.otherPURE UUID: 24bde436-c480-4da8-be71-2631e73d3345
dc.description.abstractGradients of high-dimensional functions can be computed efficiently and with machine accuracy by so-called adjoint codes. We present an L-attributed grammar for the single-pass generation of intraprocedural adjoint code for a simple imperative language (a subset of C). Our ideas can easily be applied to any programming language that is suitable for syntax-directed translation.Moreover the conceptual insights are useful in the context of multi-pass generation of adjoint code. Our focus is on correctness. The necessary domain-specific code optimizations are beyond the scope of this paper. We give references to corresponding work in this areaen
dc.relation.ispartofProcs of IMCSIT'07
dc.titleAn L-Attributed Grammar for Adjoint Codeen
dc.contributor.institutionSchool of Computer Science

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record