[HTML][HTML] Forward-or reverse-mode automatic differentiation: What's the difference?

B van den Berg, T Schrijvers, J McKinna… - Science of Computer …, 2024 - Elsevier
Automatic differentiation (AD) has been a topic of interest for researchers in many
disciplines, with increased popularity since its application to machine learning and neural …

Efficient CHAD

TJ Smeding, MIL Vákár - Proceedings of the ACM on Programming …, 2024 - dl.acm.org
We show how the basic Combinatory Homomorphic Automatic Differentiation (CHAD)
algorithm can be optimised, using well-known methods, to yield a simple, composable, and …

Partial Evaluation of Automatic Differentiation for Differential-Algebraic Equations Solvers

O Eriksson, V Palmkvist, D Broman - Proceedings of the 22nd ACM …, 2023 - dl.acm.org
Differential-Algebraic Equations (DAEs) are the foundation of high-level equation-based
languages for modeling physical dynamical systems. Simulating models in such languages …

Algeo: An Algebraic Approach to Reversibility

F Henglein, R Kaarsgaard, MK Mathiesen - International Conference on …, 2022 - Springer
We present Algeo, a functional logic programming language based on the theory of infinite
dimensional modules. Algeo is reversible in the sense that every function has a generalised …

Programming with High-Level Abstractions, Proceedings of the 3rd Workshop on Logic and Practice of Programming

DS Warren, YA Liu - arxiv preprint arxiv:2409.19211, 2024 - arxiv.org
This proceedings contains abstracts and position papers for the work presented at the third
Logic and Practice of Programming (LPOP) Workshop. The workshop was held online, using …

[PDF][PDF] The Programming of Algebra

MK Mathiesen - 2022 - di.ku.dk
We study how abstract algebra can be used as a foundation for programming, in particular
for the purpose of query processing. The basic algebraic structures of rings, modules and …

[PDF][PDF] Simple Worst-Case Optimal Joins

F Henglein, C Li, MK Mathiesen - 35th Nordic Workshop on Programming … - nwpt24.github.io
We show that worst-case optimal joins, also for cyclic joins, are easy to program using basic
programming techniques. They only require straightforward dictionaries, iterating over the …