{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T17:26:45Z","timestamp":1750440405103},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421276"},{"type":"electronic","value":"9783540451426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45142-0_4","type":"book-chapter","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T21:17:34Z","timestamp":1185916654000},"page":"57-68","source":"Crossref","is-referenced-by-count":3,"title":["Higher-Order Transformation of Logic Programs"],"prefix":"10.1007","author":[{"given":"Silvija","family":"Seres","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Spivey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,2]]},"reference":[{"key":"4_CR1","unstructured":"M. Baudinet. Logic Programming Semantics Techniques and Applications. PhD thesis, Stanford Univeristy, 1989."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"R. Bird and O. de Moor. Algebra of Programming. Prentice Hall, 1997.","DOI":"10.1007\/978-3-642-61455-2_12"},{"key":"4_CR3","unstructured":"E. Boiten. The many disguises of accumulation. Technical Report 91-26, University of Nijmegen, 1991."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"K. L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293\u2013322. Plenum Press, 1978.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"4_CR5","series-title":"Lect Notes Comput Sci","first-page":"116","volume-title":"Procs. 3rd International Summer School on Advanced Functional Programming","author":"O. Moor de","year":"1998","unstructured":"O. de Moor and G. Sittampalam. Generic program transformation. In Procs. 3rd International Summer School on Advanced Functional Programming, pages 116\u2013149, Springer LNCS 1608, 1998."},{"key":"4_CR6","first-page":"98","volume-title":"Proc. of FLOPS\u201998","author":"R. Hinze","year":"1998","unstructured":"R. Hinze. Prological features in a functional setting-axioms and implementations. In Proc. of FLOPS\u201998, pages 98\u2013122, World Scientific, Japan, 1998."},{"key":"4_CR7","first-page":"697","volume":"5","author":"A. Pettorossi","year":"1998","unstructured":"A. Pettorossi and M. Proietti. In Handbook of Logic in Artificial Intelligence and Logic Programming, volume 5, chapter Transformation of Logic Programs, pages 697\u2013787. Oxford University Press, 1998.","journal-title":"Handbook of Logic in Artificial Intelligence and Logic Programming"},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/978-0-387-35264-0_12","volume-title":"Proceedings of IFIP TC2 Working Conference on Algorithmic Languages and Calculi","author":"A. Pettorossi","year":"1997","unstructured":"A. Pettorossi and M. Proietti. Program derivation via list introduction. In Proceedings of IFIP TC2 Working Conference on Algorithmic Languages and Calculi, pages 296\u2013323. Chapman and Hall, Le bischenberg, France, 1997."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"B. J. Ross. Using algebraic semantics for proving Prolog termination and transformation. In Proceedings of the ALPUK 1991, pages 135\u2013155. Edinburgh, Springer, 1991.","DOI":"10.1007\/978-1-4471-3546-3_8"},{"key":"4_CR10","unstructured":"S. Seres. The Algebra of Logic Programming. PhD thesis, Oxford University, 2001 (to appear)."},{"issue":"4","key":"4_CR11","first-page":"433","volume":"6","author":"S. Seres","year":"1999","unstructured":"S. Seres and J. M. Spivey. Functional Reading of Logic Programs. In Journal of Universal Computer Science, volume 6(4), pages 433\u2013446, 1999.","journal-title":"Journal of Universal Computer Science"},{"key":"4_CR12","first-page":"184","volume-title":"Proceedings of ICLP\u201999","author":"S. Seres","year":"1999","unstructured":"S. Seres, J. M. Spivey, and C. A. R. Hoare, Algrebra of Logic Programming Proceedings of ICLP\u201999, pages 184\u2013199, Las Cruces, USA, The MIT Press, 1999."},{"issue":"4","key":"4_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1017\/S0956796800003749","volume":"10","author":"J. M. Spivey","year":"2000","unstructured":"J. M. Spivey. The monad of breadth-first search. Journal of Functional Programming, volume 10(4), pages 397\u2013408, 2000.","journal-title":"Journal of Functional Programming"},{"issue":"1","key":"4_CR14","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1145\/322169.322183","volume":"27","author":"M. Wand","year":"1980","unstructured":"M. Wand. Continuation-based program transformation strategies. Journal of the ACM, volume 27(1), pages 164\u2013180, 1980.","journal-title":"Journal of the ACM"},{"key":"4_CR15","unstructured":"M. Wand. A semantic algebra for logic programming. Technical Report 148, Indiana University Computer Science Department, 1983."}],"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-45142-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T12:27:30Z","timestamp":1556713650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45142-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421276","9783540451426"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45142-0_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}