{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:02:57Z","timestamp":1725487377660},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404385"},{"type":"electronic","value":"9783540450139"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45013-0_11","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:06:29Z","timestamp":1184601989000},"page":"126-143","source":"Crossref","is-referenced-by-count":1,"title":["Refinement of Higher-Order Logic Programs"],"prefix":"10.1007","author":[{"given":"Robert","family":"Colvin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Hayes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Hemer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Strooper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"11_CR1","unstructured":"B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990."},{"issue":"1\u20132","key":"11_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(00)00402-3","volume":"269","author":"O. Moor de","year":"2001","unstructured":"Oege de Moor and Ganesh Sittampalam. Higher-order matching for program transformation. Theoretical Computer Science, 269(1\u20132):135\u2013162, 2001.","journal-title":"Theoretical Computer Science"},{"issue":"20","key":"11_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0743-1066(94)90029-9","volume":"19","author":"Y. Deville","year":"1994","unstructured":"Y. Deville and K.-K. Lau. Logic program synthesis. Journal of Logic Programming, 19,20:321\u2013350, 1994. Special Issue: Ten Years of Logic Programming.","journal-title":"Journal of Logic Programming"},{"key":"11_CR4","unstructured":"I. Hayes, R. Nickson, P. Strooper, and R. Colvin. A declarative semantics for logic program refinement. Technical Report 00-30, Software Verification Research Centre, The University of Queensland, 2000."},{"issue":"4\u20135","key":"11_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1017\/S1471068402001448","volume":"2","author":"I. J. Hayes","year":"2002","unstructured":"I. J. Hayes, R. Colvin, D. Hemer, R. Nickson, and P. A. Strooper. A refinement calculus for logic programs. Theory and Practice of Logic Programming, 2(4\u20135):425\u2013460, July\u2013September 2002.","journal-title":"Theory and Practice of Logic Programming"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"David Lacey, Julian Richardson, and Alan Smaill. Logic program synthesis in a higher-order setting. In John W. Lloyd et al., editor, Computational Logic 2000, volume 1861 of LNAI, pages 87\u2013100. Springer-Verlag, 2000.","DOI":"10.1007\/3-540-44957-4_6"},{"key":"11_CR7","unstructured":"Zohar Manna. Mathematical Theory of Computation. McGraw-Hill, 1974."},{"key":"11_CR8","unstructured":"Carroll Morgan. Programming from Specifications. Prentice Hall, second edition, 1994."},{"key":"11_CR9","unstructured":"G. Nadathur and D. Miller. An overview of Lambda-PROLOG. In Kenneth A. Bowen and Robert A. Kowalski, editors, Fifth International Logic Programming Conference, pages 810\u2013827. MIT Press, 1988."},{"key":"11_CR10","first-page":"499","volume-title":"Handbook of Logics for Artificial Intelligence and Logic Programming","author":"G. Nadathur","year":"1998","unstructured":"G. Nadathur and D. Miller. Higher-order logic programming. In Dov M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logics for Artificial Intelligence and Logic Programming, volume 5, chapter 8, pages 499\u2013590. Clarendon Press, Oxford, 1998."},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6423(00)00005-8","volume":"41","author":"D. A. Naumann","year":"2001","unstructured":"D. A. Naumann. Predicate transformer semantics of a higher order imperative language with record subtyping. Science of Computer Programming, 41(1):1\u201351, September 2001.","journal-title":"Science of Computer Programming"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"H. A. Partsch. Specification and Transformation of Programs. Springer-Verlag, 1990.","DOI":"10.1007\/978-3-642-61512-2"},{"key":"11_CR13","unstructured":"D. Sannella. Formal program development in Extended ML for the working programmer. In Proc. 3rd BCS\/FACS Workshop on Refinement, Springer Workshops in Computing, pages 99\u2013130. Springer, 1990."},{"key":"11_CR14","series-title":"Lect Notes Comput Sci","first-page":"57","volume-title":"Proceedings of the Tenth International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR 2000)","author":"S. Seres","year":"2000","unstructured":"S. Seres and M. Spivey. Higher-order transformation of logic programs. In K.-K. Lau, editor, Proceedings of the Tenth International Workshop on Logic-based Program Synthesis and Transformation (LOPSTR 2000), volume 2042 of LNCS, pages 57\u201368. Springer-Verlag, 2000."},{"key":"11_CR15","unstructured":"Z. Somogyi, F.J. Henderson, and T.C. Conway. Mercury, an efficient purely declarative logic programming language. In R. Kotagiri, editor, Proceedings of the Eighteenth Australasian Computer Science Conference, pages 499\u2013512, Glenelg, South Australia, 1995. Australian Computer Science Communications."},{"key":"11_CR16","unstructured":"J. M. Spivey. The Z Notation: A Reference Manual. Prentice Hall, second edition, 1992."},{"key":"11_CR17","unstructured":"Nigel Ward. A Refinement Calculus for Nondeterministic Expressions. PhD thesis, Department of Computer Science, University of Queensland, 1994."}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45013-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T23:09:43Z","timestamp":1550444983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45013-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404385","9783540450139"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45013-0_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}