{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:23:21Z","timestamp":1745987001409,"version":"3.40.4"},"publisher-location":"London","reference-count":19,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540197423"},{"type":"electronic","value":"9781447134947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-1-4471-3494-7_23","type":"book-chapter","created":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T04:16:55Z","timestamp":1362111415000},"page":"318-331","source":"Crossref","is-referenced-by-count":4,"title":["Non-Determinism and Lazy Evaluation in Logic Programming"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Sergio Antoy. Design strategies for rewrite rules. In CTRS\u2019l90, Montreal, Canada, June 1990. LNCS 516.","DOI":"10.1007\/3-540-54317-1_102"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Sergio Antoy. Lazy evaluation in logic. In PLILP\u201991, Passau, Germany, August 1991, 371-382. LNCS 528.","DOI":"10.1007\/3-540-54444-5_113"},{"key":"23_CR3","unstructured":"L. G. Bouma and H. R. Walters. Implementing algebraic specifications. In J. A. Bergstra, J. Heering, and P. Klint, editors, Algebraic Specification, chapter 5. Addison-Wesley, Wokingham, England, 1989."},{"key":"23_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-96873-0","volume-title":"Programming in Prolog","author":"WF Clocksin","year":"1984","unstructured":"W. F. Clocksin and C. S. Mellish. Programming in Prolog, Springer-Verlag, Berlin, second edition, 1984.","edition":"2"},{"key":"23_CR5","unstructured":"Doug DeGroot and Gary Lindstrom, editors. Logic Programming: Functions, Relations, and Equations, Englewood Cliffs, ? J, 1986. Prentice-Hall."},{"key":"23_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015791","volume-title":"Foundation of Equational Logic Programming","author":"S H\u00f6lldobler","year":"1989","unstructured":"S. H\u00f6lldobler. Foundation of Equational Logic Programming. Springer-Verlag, Berlin, 1989. Lect. Notes in Artificial Intelligence, Vol. 3"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1145\/72551.72554","volume":"21","author":"P Hudak","year":"1989","unstructured":"Paul Hudak. Conception, evolution, and application of functional programming languages. Computing Surveys, 21: 359\u2013411, 1989.","journal-title":"Computing Surveys"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G Huet","year":"1980","unstructured":"G\u00e9rard Huet. Confluent reductions: Abstract properties and applications to term-rewriting systems. J ACM, 27: 797\u2013821, 1980","journal-title":"J ACM"},{"key":"23_CR9","unstructured":"G\u00e9rard Huet and Jean-Jacques L\u00e9 evy. Call by need computations in non-ambiguous linear term rewriting systems. Technical Report 359, INRIA, Le Chesnay, France, 1979."},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0168-0072(89)90024-9","volume":"43","author":"JR Kenneway","year":"1989","unstructured":"J. R. Kenneway. Sequential evaluation strategies for parallel-or and related reduction systems. Annals of Pure and Applied Logics, 43: 31\u201356, 1989.","journal-title":"Annals of Pure and Applied Logics"},{"key":"23_CR11","unstructured":"Jan Willem Klop. Term rewriting systems. Technical Report CS-R9073, Stichting Mathematisch Centrum, Amsterdam, The Netherlands, 1990."},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0743-1066(86)90016-6","volume":"3","author":"S Narain","year":"1986","unstructured":"Sanjai Narain. A technique for doing lazy evaluation in logic. The Journal of Logic Programming, 3: 259\u2013276, 1986.","journal-title":"The Journal of Logic Programming"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Michael J. O\u2019 Donnell. Equational Logic as a Programming Language. MIT Press, 1985.","DOI":"10.1007\/3-540-15648-8_20"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"H. Petzsch. Automatic prototyping of algebraic specifications using Prolog. In Recent Trends in Data Type Specification, pages 207-223. 3rd Workshop on Theory and Applications of Abstract Data Types, Springer-Verlag, 1985.","DOI":"10.1007\/978-3-662-09691-8_16"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"R. C. Sekar and I. V. Ramakrishnan. Programming in equational logic: Beyond strong sequentiality. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 230-241, Philadelphia, PA, June 1990.","DOI":"10.1109\/LICS.1990.113749"},{"key":"23_CR16","volume-title":"The Art of Prolog","author":"L Sterling","year":"1986","unstructured":"Leon Sterling and Ehud Shapiro. The Art of Prolog. The MIT Press, Cambridge, MA, 1986."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0020-0190(85)90068-7","volume":"20","author":"S Thatte","year":"1985","unstructured":"Satish Thatte. On the correspondence between two classes of reduction systems. Information Processing Letters, 20: 83\u201385, 1985.","journal-title":"Information Processing Letters"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0743-1066(87)90006-9","volume":"4","author":"MH Emden van","year":"1987","unstructured":"Maar ten H. van Emden and Keitaro Yukawa. Logic programming with equations. The Journal of Logic Programming, 4: 265\u2013288, 1987.","journal-title":"The Journal of Logic Programming"},{"key":"23_CR19","volume-title":"Systematic Programming: An Introduction","author":"N Wirth","year":"1973","unstructured":"Nicklaus Wirth. Systematic Programming: An Introduction. Prentice-Hall, Englewood Cliffs, NJ, 1973."}],"container-title":["Workshops in Computing","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-3494-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T22:26:16Z","timestamp":1745965576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-3494-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540197423","9781447134947"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-3494-7_23","relation":{},"ISSN":["1431-1682"],"issn-type":[{"type":"print","value":"1431-1682"}],"subject":[],"published":{"date-parts":[[1992]]}}}