{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:15:03Z","timestamp":1725488103923},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540675303"},{"type":"electronic","value":"9783540454991"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45499-3_27","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T01:55:04Z","timestamp":1185933304000},"page":"371-390","source":"Crossref","is-referenced-by-count":10,"title":["Pointwise Relational Programming"],"prefix":"10.1007","author":[{"given":"Oege","family":"de Moor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Gibbons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"C. J. Aarts, R. C. Backhouse, P. F. Hoogendijk, E. Voermans, and J. C. S. P. Van der Woude. A relational theory of datatypes. September 1992.","key":"27_CR1","DOI":"10.1007\/3-540-57499-9_15"},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","first-page":"368","volume-title":"Mathematics of Program Construction","author":"A. Augusteijn","year":"1992","unstructured":"A. Augusteijn. An alternative derivation of a binary heap construction function. In R. S. Bird, C. C. Morgan, and J. C. P. Woodcock, editors, Mathematics of Program Construction, volume 669 of Lecture Notes in Computer Science, pages 368\u2013374. Springer-Verlag, 1992."},{"key":"27_CR3","first-page":"219","volume":"38","author":"R. C. Backhouse","year":"1989","unstructured":"R. C. Backhouse. Making formality work for us. EATCS Bulletin, 38:219\u2013249, 1989.","journal-title":"EATCS Bulletin"},{"unstructured":"R. C. Backhouse, P. De Bruin, P. F. Hoogendijk, G. Malcolm, T. S. Voermans, and J. C. S. P. Van der Woude. Polynomial relators. In M. Nivat, C. S. Rattray, T. Rus, and G. Scollo, editors, Algebraic Methodology and Software Technology, Workshops in Computing, pages 303\u2013362. Springer-Verlag, 1992.","key":"27_CR4"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus. Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs. Communications of the ACM, 21:613\u2013641, 1978.","journal-title":"Communications of the ACM"},{"unstructured":"M. Barr and C. Wells. Category Theory for Computing Science. International Series in Computer Science. Prentice Hall, 1990.","key":"27_CR6"},{"key":"27_CR7","series-title":"Lect Notes Comput Sci","volume-title":"The Munich Project CIP. Volume I: The Wide Spectrum Language CIP-L","author":"F. L. Bauer","year":"1985","unstructured":"F. L. Bauer, R. Berghammer, M. Broy, W. Dosch, F. Geiselbrechtinger, R. Gnatz, E. Hangel, W. Hesse, B. Krieg-Br\u00fcckner, A. Laut, T. Matzner, B. M\u00f6ller, F. Nickl, H. Partsch, P. Pepper, K. Samelson, M. Wirsing, and H. W\u00f6ssner. The Munich Project CIP. Volume I: The Wide Spectrum Language CIP-L, volume 183 of Lecture Notes in Computer Science. Springer-Verlag, 1985."},{"doi-asserted-by":"crossref","unstructured":"F. L. Bauer and H. W\u00f6ssner. Algorithmic Language and Program Development. Texts and Monographs in Computer Science. Springer-Verlag, 1982.","key":"27_CR8","DOI":"10.1007\/978-3-642-61807-9"},{"unstructured":"R. Berghammer, P. Kempf, G. Schmidt, and T. Str\u00f6hlein. Relation algebra and logic of programs. In H. Andreka and J. D. Monk, editors, Algebraic Logic, volume 54 of Colloquia Mathematica Societatis Janos Bolyai, pages 37\u201358. North-Holland, 1991.","key":"27_CR9"},{"key":"27_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-60117-1_10","volume-title":"Mathematics of Program Construction","author":"R. Berghammer","year":"1995","unstructured":"R. Berghammer and B. Von Karger. Formal derivation of CSP programs from temporal specifications. In Mathematics of Program Construction, volume 947 of Lecture Notes in Computer Science, pages 180\u2013196. Springer-Verlag, 1995."},{"doi-asserted-by":"crossref","unstructured":"R. S. Bird. Lectures on constructive functional programming. In M. Broy, editor, Constructive Methods in Computing Science, volume 55 of NATO ASI Series F, pages 151\u2013216. Springer-Verlag, 1989.","key":"27_CR11","DOI":"10.1007\/978-3-642-74884-4_5"},{"unstructured":"R. S Bird. Introduction to Functional Programming in Haskell. International Series in Computer Science. Prentice Hall, 1998.","key":"27_CR12"},{"doi-asserted-by":"crossref","unstructured":"R. S. Bird and O. De Moor. Algebra of Programming. International Series in Computer Science. Prentice Hall, 1996.","key":"27_CR13","DOI":"10.1007\/978-3-642-61455-2_12"},{"doi-asserted-by":"crossref","unstructured":"C. Brink and G. Schmidt, editors. Relational Methods in Computer Science. Springer-Verlag, 1996. Supplemental Volume of the Journal Computing, to appear.","key":"27_CR14","DOI":"10.1007\/978-3-7091-6510-2"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6423(90)90042-C","volume":"15","author":"W. Chen","year":"1990","unstructured":"W. Chen and J. T. Udding. Program inversion: More than fun! Science of Computer Programming, 15(1):1\u201313, 1990.","journal-title":"Science of Computer Programming"},{"unstructured":"P. L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science. Pitman, 1986.","key":"27_CR16"},{"unstructured":"E. W. Dijkstra. A Discipline of Programming. Series in Automatic Computation. Prentice Hall, 1976.","key":"27_CR17"},{"issue":"3","key":"27_CR18","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1145\/321172.321179","volume":"10","author":"R. W. Floyd","year":"1963","unstructured":"R. W. Floyd. Syntactic analysis and operator precedence. Journal of the ACM, 10(3):316\u2013333, 1963.","journal-title":"Journal of the ACM"},{"doi-asserted-by":"crossref","unstructured":"D. Gries. The Science of Programming. Texts and Monographs in Computer Science. Springer-Verlag, 1981.","key":"27_CR19","DOI":"10.1007\/978-1-4612-5983-1"},{"issue":"1","key":"27_CR20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.3233\/FI-1986-9104","volume":"9","author":"C. A. R. Hoare","year":"1986","unstructured":"C. A. R. Hoare and J. He. The weakest prespecification, I. Fundamenta Informaticae, 9(1):51\u201384, 1986.","journal-title":"Fundamenta Informaticae"},{"unstructured":"G. Jones and M. Sheeran. Circuit design in Ruby. In J. Staunstrup, editor, Formal Methods for VLSI Design, pages 13\u201370. Elsevier Science Publications, 1990.","key":"27_CR21"},{"unstructured":"E. Knapen. Relational programming, program inversion and the derivation of parsing algorithms. Computing science notes, Department of Mathematics and Computing Science, Eindhoven University of Technology, 1993.","key":"27_CR22"},{"unstructured":"J. Lambek and P. J. Scott. Introduction to Higher Order Categorical Logic, volume 7 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1986.","key":"27_CR23"},{"key":"27_CR24","volume-title":"Preordered categories and predicate transformers","author":"C. E. Martin","year":"1991","unstructured":"C. E. Martin. Preordered categories and predicate transformers. D.Phil. thesis, Computing Laboratory, Oxford, UK, 1991."},{"unstructured":"L. Meertens. Algorithmics \u2014 towards programming as a mathematical activity. In J. W. De Bakker, M. Hazewinkel, and J. K. Lenstra, editors, Mathematics and Computer Science, volume 1 of CWI Monographs, pages 3\u201342. North-Holland, 1987.","key":"27_CR25"},{"doi-asserted-by":"crossref","unstructured":"J. M. Morris. Programming by expression refinement: The KMP algorithm. Chapter 37 of W. H. J. Feijen, A. J. M. van Gasteren, D. Gries, and J. Misra, editors, Beauty is our Business. Springer-Verlag, 1990.","key":"27_CR26","DOI":"10.1007\/978-1-4612-4476-9_38"},{"doi-asserted-by":"crossref","unstructured":"D. A. Naumann. Towards squiggly refinement algebra. In D. Gries and W. P. De Roever, editors, Programming Concepts and Methods, pages 346\u2013365. Chapman and Hall, 1998.","key":"27_CR27","DOI":"10.1007\/978-0-387-35358-6_23"},{"key":"27_CR28","series-title":"Lect Notes Comput Sci","first-page":"291","volume-title":"Mathematics of Program Construction","author":"B. Schoenmakers","year":"1992","unstructured":"B. Schoenmakers. Inorder traversal of a binary heap and its inversion in optimal time and space. In R. S. Bird, C. C. Morgan, and J. C. P. Woodcock, editors, Mathematics of Program Construction, volume 669 of Lecture Notes in Computer Science, pages 291\u2013301. Springer-Verlag, 1992."},{"issue":"1","key":"27_CR29","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0004-3702(85)90083-9","volume":"27","author":"D. R. Smith","year":"1985","unstructured":"D. R. Smith. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence, 27(1):43\u201396, 1985.","journal-title":"Artificial Intelligence"},{"unstructured":"N. T. E. Ward. A refinement calculus for nondeterministic expressions. Ph.D. thesis, University of Queensland, 1994.","key":"27_CR30"}],"container-title":["Lecture Notes in Computer Science","Algebraic Methodology and Software Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45499-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T16:46:09Z","timestamp":1683996369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45499-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540675303","9783540454991"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-45499-3_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}