Discovering applications of higher order functions through proof planning

Authors:
A. Cook;A. Ireland;G. Michaelson;N. Scaife
Affiliations:
School of Mathematical and Computer Sciences, Heriot-Watt University, EH14 4AS, Riccarton, Edinburgh, Scotland;School of Mathematical and Computer Sciences, Heriot-Watt University, EH14 4AS, Riccarton, Edinburgh, Scotland;School of Mathematical and Computer Sciences, Heriot-Watt University, EH14 4AS, Riccarton, Edinburgh, Scotland;VERIMAG, Centre Equation 2, Ave de Vignat, 38610, Griers, France
Venue:
Formal Aspects of Computing
Year:
2005

Citing 0
Cited 2

Hume box calculus: robust system development through software transformation

Higher-Order and Symbolic Computation
Empirical parallel performance prediction from semantics-based profiling

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The close association between higher order functions (HOFs) and algorithmic skeletons is a promising source of automatic parallelisation of programs. A theorem proving approach to discovering HOFs in functional programs is presented. Our starting point is proof planning, an automated theorem proving technique in which high-level proof plans are used to guide proof search. We use proof planning to identify provably correct transformation rules that introduce HOFs. The approach has been implemented in the λ Clam proof planner and tested on a range of examples. The work was conducted within the context of a parallelising compiler for Standard ML.