In these lecture notes we describe an algebraic approach to programming, suitable both for
the derivation of individual programs and for the study of programming techniques in …

The Kestrel Interactive Development System (KIDS), which provides automated support for
the development of correct and efficient programs from formal specifications, is described …

From dynamic programming to greedy algorithms Page 1 From Dynamic Programming to
Greedy Algorithms Richard Bird and Oege de Moor* Programming Research Group 11 …

Given $ n $ weighted points (positive or negative) in $ d $ dimensions, what is the axis-
aligned box which maximizes the total weight of the points it contains? The best known …

Dynamic programming is a strategy for solving optimisation problems. In this paper, we
show how many problems that may be solved by dynamic programming are instances of the …

Algorithm theories represent the structure common to a class of algorithms, such as divide-
and-conquer or backtrack. An algorithm theory for a class A provides the basis for design …

It has been attracting much attention to make use of list homomorphisms in parallel
programming because they ideally suit the divide-and-conquer parallel paradigm. However …

Homomorphisms are functions that match the divide-and-conquer pattern and are widely
used in parallel programming. Two problems are studied for homomorphisms on lists: The …

A formal algebraic model for divide-and-conquer algorithms is presented. The model reveals
the internal structure of divide-and-conquer functions, leads to high-level and functional …

Learning the evolutionary dynamics of Partial Differential Equations (PDEs) is critical in
understanding dynamic systems, yet current methods insufficiently learn their …