List partitions |
| |
| Authors: | R. S. Bird O. de Moor |
| |
| Affiliation: | (1) Oxford University Programming Research Group, Oxford, UK |
| |
| Abstract: | By definition, apartition 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.Supported by a BP research studentship. |
| |
| Keywords: | Dynamic programming Greedy algorithm List partitions Program calculus Program transformation |
| 本文献已被 SpringerLink 等数据库收录！ |
|
