Algebraic methods for optimization problems

Authors:
Richard Bird;Jeremy Gibbons;Shin-Cheng Mu
Affiliations:
Computing Laboratory, University of Oxford;Computing Laboratory, University of Oxford;Computing Laboratory, University of Oxford
Venue:
Algebraic and coalgebraic methods in the mathematics of program construction
Year:
2002

Citing 14
Cited 4

Programs are predicates

Proc. of a discussion meeting of the Royal Society of London on Mathematical logic and programming languages
Relational algebraic semantics of deterministic and nondeterministic programs

Theoretical Computer Science
Essays in computing science

Essays in computing science
Introduction to algorithms

Introduction to algorithms
The craft of Prolog

The craft of Prolog
Programming by expression refinement: the KMP algorithm

Beauty is our business
A practical theory of programming

A practical theory of programming
Computer program construction

Computer program construction
Algebra of programming

Algebra of programming
Non-deterministic expressions and predicate transformers

Information Processing Letters
The Science of Programming

The Science of Programming
Elements of a Relational Theory of Datatypes

Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Logical Specifications for Functional Programs

Proceedings of the Second International Conference on Mathematics of Program Construction
FUNCTIONAL PEARL

Journal of Functional Programming

Inverting Functions as Folds

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Theory and applications of inverting functions as folds

Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning

Proceedings of the 6th ACM SIGPLAN workshop on Generic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We argue for the benefits of relations over functions for modelling programs, and even more so for modelling specifications. To support this argument, we present an extended case study for a class of optimization problems, deriving efficient functional programs from concise relational specifications.