{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T21:24:19Z","timestamp":1782422659991,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540634591","type":"print"},{"value":"9783540695554","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0027000","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:34:01Z","timestamp":1132396441000},"page":"16-30","source":"Crossref","is-referenced-by-count":40,"title":["Optimal non-deterministic functional logic computations"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"S. Antoy. Definitional trees. In Proc. of the 4th Intl. Conf. on Algebraic and Logic Programming, pages 143\u2013157. Springer LNCS 632, 1992.","DOI":"10.1007\/BFb0013825"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In Proc. 21st ACM Symposium on Principles of Programming Languages, pages 268\u2013279, Portland, 1994. Full versions at URL vvv.cs.pdx.adu\/~antoy\/publications.html.","DOI":"10.1145\/174675.177899"},{"key":"2_CR3","volume-title":"Introduction to Functional Programming","author":"R. Bird","year":"1988","unstructured":"R. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall, New York, NY, 1988."},{"key":"2_CR4","unstructured":"Curry: An integrated functional logic language. M. Hanus (ed.), Draft Dec. 5, 1996."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","volume":"1","author":"E. Eder","year":"1985","unstructured":"E. Eder. Properties of substitutions and unifications. Journal of Symbolic Computation, 1:31\u201346,1985.","journal-title":"Journal of Symbolic Computation"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"J. C. Gonz\u00e1lez Moreno, F. J. L\u00f3pez Fraguas, M. T. Hortal\u00e1 Gonz\u00e1lez, and M. Rodr\u00e9guez Artalejo. A rewriting logic for declarative programming. In ESOP' 96, Link\u00f6ping, Sweden, April, 1996. LNCS 1058, Extended version TR DIA 95\/5.","DOI":"10.1007\/3-540-61055-3_35"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"M. Hanus. On extra variables in (equational) logic programming. In Proc. Twelfth International Conference on Logic Programming, pages 665\u2013679. MIT Press, 1995.","DOI":"10.7551\/mitpress\/4298.003.0065"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"M. Hanus. A unified computation model for functional logic programming. In Proc. 24th ACM Symposium on Principles of Programming Languages, pages 80\u201393, Paris, 1997.","DOI":"10.1145\/263699.263710"},{"key":"2_CR9","volume-title":"Computational logic: essays in honour of Alan Robinson","author":"G. Huet","year":"1991","unstructured":"G. Huet and J. J. L\u00e9vy. Computations in orthogonal term rewriting systems. In J. L. Lassez and G. Plotkin, editors, Computational logic: essays in honour of Alan Robinson. MIT Press, Cambridge, MA, 1991. Previous version: Call by need computations in nonambiguous linear term rewriting systems, Technical Report 359, INRIA, Le Chesnay, France, 1979."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0743-1066(92)90026-Y","volume":"12","author":"H. Hussmann","year":"1992","unstructured":"H. Hussmann. Nondeterministic algebraic specifications and nonconfluent rewriting. J. of Logic Programming, 12:237\u2013255, 1992.","journal-title":"J. of Logic Programming"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"A. Middeldorp. Call by need computations to root-stable form. In Proc. 24th ACM Symposium on Principles of Programming Languages, pages 94\u2013105, Paris, 1997.","DOI":"10.1145\/263699.263711"},{"key":"2_CR12","volume-title":"The Craft of Prolog","author":"R. A. O'Keefe","year":"1990","unstructured":"R. A. O'Keefe. The Craft of Prolog. The MIT Press, Cambridge, MA, 1990."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"T. Suzuki, A. Middeldorp, and T. Ida. Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In 6th International Conference on Rewriting Techniques and Applications, pages 179\u2013193, Kaiserslautern, 1995. Lecture Notes in Computer Science 914.","DOI":"10.1007\/3-540-59200-8_56"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T23:19:12Z","timestamp":1706743152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634591","9783540695554"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0027000","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}