{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:44Z","timestamp":1725664724707},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609834"},{"type":"electronic","value":"9783540497516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60983-0_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:09:38Z","timestamp":1330290578000},"page":"273-287","source":"Crossref","is-referenced-by-count":1,"title":["A definitional approach to functional logic programming"],"prefix":"10.1007","author":[{"given":"Olof","family":"Torgersson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0743-1066(93)90043-G","volume":"16","author":"H. A\u00eft-Kaci","year":"1993","unstructured":"H. A\u00eft-Kaci and A. Podelski. Towards a meaning of life. Journal of Logic Programming, 16:195\u2013234, 1993.","journal-title":"Journal of Logic Programming"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"S. Antoy. Definitional trees. In Int. Conf. on Algebraic and Logic Programming ALP'92, Springer LNCS 632, pages 143\u2013157. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0013825"},{"key":"19_CR3","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, 1994.","DOI":"10.1145\/174675.177899"},{"key":"19_CR4","unstructured":"M. Aronsson. A definitional approach to the combination of functional and relational programming. Research Report SICS T91:10, Swedish Institute of Computer Science, 1991."},{"key":"19_CR5","unstructured":"M. Aronsson. Methodology and programming techniques in GCLAII. In Proc. of Extensions of logic programming, ELP'91, Springer LNAI 596, 1992."},{"key":"19_CR6","volume-title":"PhD thesis","author":"M. Aronsson","year":"1993","unstructured":"M. Aronsson. GCLA, The Design, Use, and Implementation of a Program Development System. PhD thesis, Stockholm University, Stockholm, Sweden, 1993."},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"M. Aronsson. Implementational issues in GCLA: A-sufficiency and the definiens operation. In Proc. of Extensions of logic programming, ELP'92, Springer LNAI 660, 1993.","DOI":"10.1007\/3-540-56454-3_19"},{"key":"19_CR8","first-page":"120","volume":"798","author":"G. Falkman","year":"1994","unstructured":"G. Falkman and O. Torgersson. Programming methodologies in GCLA. In Extensions of logic programming, ELP'93, pages 120\u2013151, Springer LNAI 798, 1994.","journal-title":"Springer LNAI"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0022-0000(91)90009-T","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"E. Giovannetti, G. Levi, C. Moiso, and C. Palamidessi. Kernel-LEAF: A logic plus functional language. Journal of Computer and System Sciences, 42:139\u2013185, 1991.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"19_CR10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0304-3975(06)80007-1","volume":"87","author":"L. Halln\u00e4s","year":"1991","unstructured":"L. Halln\u00e4s. Partial inductive definitions. Theoretical Computer Science, 87(1):115\u2013142, 1991.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"19_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1093\/logcom\/1.2.261","volume":"1","author":"L. Halln\u00e4s","year":"1990","unstructured":"L. Halln\u00e4s and P. Schroeder-Heister. A proof-theoretic approach to logic programming. Journal of Logic and Computation, 1(2):261\u2013283, 1990. Part 1: Clauses as Rules.","journal-title":"Journal of Logic and Computation"},{"issue":"5","key":"19_CR12","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1093\/logcom\/1.5.635","volume":"1","author":"L. Halln\u00e4s","year":"1991","unstructured":"L. Halln\u00e4s and P. Schroeder-Heister. A proof-theoretic approach to logic programming. Journal of Logic and Computation, 1(5):635\u2013660, 1991. Part 2: Programs as Definitions.","journal-title":"Journal of Logic and Computation"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19\/20","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The integration of functions into logic programming; from theory to practice. Journal of Logic Programming, 19\/20:593\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"P. Kreuger. GCLA II: a definitional approach to control. In Extensions of logic programming, ELP91, Springer LNAI 596, 1992.","DOI":"10.1007\/BFb0013611"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"P. Kreuger. Axioms in definitional calculi. In Extensions of logic programming, ELP93, Springer LNAI 798, 1994.","DOI":"10.1007\/3-540-58025-5_57"},{"key":"19_CR16","volume-title":"PhD thesis","author":"P. Kreuger","year":"1995","unstructured":"P. Kreuger. Computational Issues in Calculi of Partial Inductive Definitions. PhD thesis, Department of Computing Science, University of G\u00f6teborg, G\u00f6teborg, Sweden, 1995."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer Verlag, second extended edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"19_CR18","unstructured":"J. Lloyd. Combining functional and logic programming languages. In Proceedings of the 1994 International Logic Programming Symposium, ILPS'94, 1994."},{"key":"19_CR19","first-page":"184","volume":"714","author":"R. Loogen","year":"1993","unstructured":"R. Loogen, F. L\u00f3pez-Fraguas, and M. Rodr\u00edguez-Artalejo. A demand driven computation strategy for lazy narrowing. In Proc. of the 5th Int. Symposium on Programming Language Implementation and Logic Programming,PLIP'93, pages 184\u2013200, Springer LNCS 714, 1993.","journal-title":"Springer LNCS"},{"key":"19_CR20","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J. J. Moreno-Navarro","year":"1992","unstructured":"J. J. Moreno-Navarro and M. Rodr\u00edguez-Artalejo. Logic programming with functions and predicates: The language BABEL. Journal of Logic Programming, 12:191\u2013223, 1992.","journal-title":"Journal of Logic Programming"},{"key":"19_CR21","first-page":"15","volume":"528","author":"L. Naish","year":"1991","unstructured":"L. Naish. Adding equations to NU-Prolog. In Proc. of the 3rd Int. Symposium on Programming Language Implementation and Logic Programming, pages 15\u201326, Springer LNCS 528, 1991.","journal-title":"Springer LNCS"},{"key":"19_CR22","first-page":"394","volume":"915","author":"S. Okui","year":"1995","unstructured":"S. Okui, A. Middeldorp, and T. Ida. Lazy narrowing: Strong completeness and eager variable elimination (extended abstract). In TAPSOFT'95: Theory and Practice of Software Development, pages 394\u2013408. Springer LNCS 915, 1995.","journal-title":"Springer LNCS"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"P. Padawitz. Computing in Horn Clause Theories, volume 16 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.","DOI":"10.1007\/978-3-642-73824-1"},{"key":"19_CR24","unstructured":"U. S. Reddy. Narrowing as the operational semantics of functional languages. In Proceedings of the IEEE International Symposium on Logic Programming, pages 138\u2013151. IEEE Computer Soc. Press, 1985."},{"key":"19_CR25","unstructured":"O. Torgersson. Functional logic programming in GCLA. In Proceedings of the 6th Nordic Workshop on Programming Theory. Aarhus, 1994."},{"key":"19_CR26","unstructured":"D. H. D. Warren. Higher-order extensions to prolog\u2014are they needed? In D. Mitchie, editor, Machine Intelligence 10, pages 441\u2013454. Edinburgh University Press, 1982."}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60983-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:22Z","timestamp":1605647002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60983-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609834","9783540497516"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-60983-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}