{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T16:52:30Z","timestamp":1694623950621},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1993,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            By definition, a\n            <jats:italic>partition<\/jats:italic>\n            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.\n          <\/jats:p>","DOI":"10.1007\/bf01211316","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:29:29Z","timestamp":1109338169000},"page":"61-78","source":"Crossref","is-referenced-by-count":6,"title":["List partitions"],"prefix":"10.1145","volume":"5","author":[{"given":"R. S.","family":"Bird","sequence":"first","affiliation":[{"name":"Oxford University Programming Research Group, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"de Moor","sequence":"additional","affiliation":[{"name":"Oxford University Programming Research Group, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","volume-title":"An exploration of the Bird-Meertens formalism","author":"Backhouse R.","year":"1988"},{"key":"e_1_2_1_2_2_2","volume-title":"Dynamic Programming","author":"Bellman R.","year":"1957"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(89)90036-1"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(86)90023-7","article-title":"Transformational programming and the paragraph problem","volume":"6","author":"Bird R.S.","year":"1986","journal-title":"Science of Computer Programming"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"crossref","unstructured":"R.S. Bird. An introduction to the theory of lists. Technical Monograph PRG-56 Oxford University Computing Laboratory Programming Research Group October 1986. Also in: M. Broy editor Logic of Programming and Calculi of Discrete Design NATO ASI Series 36 pages 3\u201342 Springer-Verlag 1987.","DOI":"10.1007\/978-3-642-87374-4_1"},{"key":"e_1_2_1_2_6_2","unstructured":"R.S. Bird. A calculus of functions for program derivation. Technical Monograph PRG-64 Oxford University Computing Laboratory Programming Research Group December 1987. Also in: Research Topics in Functional Programming (Edited by D. Turner) Addison-Wesley 1987."},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"crossref","unstructured":"R.S. Bird. Lectures on constructive functional programming. in Constructive Methods in Computing Science (Edited by M. Broy) NATO ASI Series F vol 55 Springer-Verlag 1989.","DOI":"10.1007\/978-3-642-74884-4_5"},{"key":"e_1_2_1_2_8_2","unstructured":"R.S. Bird. Small specification exercises. in Beauty is Our Business: A Birthday Salute to E. W. Dijkstra (Edited by W. Feijen N. van Gasteren D. Gries and J. Misra) Springer-Verlag 1990"},{"key":"e_1_2_1_2_9_2","unstructured":"J.G. Ecker and M. Kupferschmid. Introduction to Operations Research . John Wiley & Sons 1988. ISBN 0-471-88445-6."},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90101-1"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1137\/0216043"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"crossref","unstructured":"A. Hartman and M. Rodeh. Optimal parsing of strings. In A. Apostolico and Z. Galil editors Combinatorial Algorithms on Words pages 155\u2013167. Springer-Verlag 1985.","DOI":"10.1007\/978-3-642-82456-2_11"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"crossref","unstructured":"D.E. Knuth and M.F. Plass. Breaking paragraphs into lines. Software \u2014 Practice & Experience pages 1119\u20131184 1981.","DOI":"10.1002\/spe.4380111102"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"crossref","unstructured":"G. Malcolm. Homomorphisms and promotability. In J.L.A. van de Snepscheut (editor) Mathematics of Program Construction . LNCS 375 pp335\u2013347 1989.","DOI":"10.1007\/3-540-51305-1_20"},{"key":"e_1_2_1_2_15_2","unstructured":"L.G.L.T. Meertens. Algorithmics-towards programming as a mathematical activity. In J.W. de Bakker M. Hazewinkel and J.K. Lenstra editors Mathematics and Computer Science pages 289\u2013334. CWI Symposium North-Holland 1986."},{"key":"e_1_2_1_2_16_2","unstructured":"L.G.L.T. Meertens. First steps towards a theory of rose trees. Working paper 592 ROM-25 IFIP WG 2.1 1988."},{"key":"e_1_2_1_2_17_2","unstructured":"O. de Moor. Categories Relations and Dynamic Programming . D. Phil Thesis Oxford University Computing Laboratory Programming Research Group 1992."},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"crossref","unstructured":"M. Spivey. A categorical approach to the theory of lists. In J.L.A. van de Snepscheut (editor) Mathematics of Program Construction . LNCS 375 pp399\u2013408 1989.","DOI":"10.1007\/3-540-51305-1_24"},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/322344.322346"},{"key":"e_1_2_1_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/361972.361982"},{"key":"e_1_2_1_2_21_2","unstructured":"N. Wirth. Algorithms+Data Structures=Programs . Prentice-Hall 1976. ISBN 0-13-022418-9."}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211316.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211316\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:22:40Z","timestamp":1641482560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1007\/BF01211316"],"URL":"https:\/\/doi.org\/10.1007\/bf01211316","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}