List partitions

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1993 United Kingdom English Publisher:Association for Computing Machinery (ACM)Journal:Formal Aspects of Computing, volume 5, pages 61-78 (issn: 0934-5043, eissn: 1433-299X,

Copyright policy )

Authors: Bird, R; de Moor, O;

doi: 10.1007/bf01211316

List partitions

- Summary
- Subjects
- Metrics

Abstract

Abstract By definition, a partition of a list is a division of that list into nonempty contiguous segments. Many programming and operations research problems can be specified in terms of list partitions, and we present a hierarchy of theorems for deriving programs from such specifications. Throughout, reasoning is conducted in an equational style using the calculus for program synthesis developed by Bird and Meertens.

Country

United Kingdom

Related Organizations

University of Oxford
United Kingdom

Keywords

dynamic programming, greedy algorithm, program transformation, list partitions, Specification and verification (program logics, model checking, etc.), program calculus, program synthesis

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average