{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:05:26Z","timestamp":1725663926278},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571865"},{"type":"electronic","value":"9783540479451"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57186-8_69","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:15:07Z","timestamp":1330240507000},"page":"28-43","source":"Crossref","is-referenced-by-count":2,"title":["A debugging model for functional logic programs"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hanus","sequence":"first","affiliation":[]},{"given":"Berthold","family":"Josephs","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"3_CR1","unstructured":"P.G. Bosco, C. Cecchi, and C. Moiso. An extension of WAM for K-LEAF: a WAM-based compilation of conditional narrowing. In Proc. Sixth International Conference on Logic Programming (Lisboa), pp. 318\u2013333. MIT Press, 1989."},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"K.A. Buettner. Fast Decompilation of Compiled Prolog Clauses. In Proc. Third International Conference on Logic Programming (London), pp. 663\u2013670. Springer LNCS 225, 1986.","DOI":"10.1007\/3-540-16492-8_116"},{"key":"3_CR3","unstructured":"L. Byrd. Understanding the Control Flow of Prolog Programs. In Proc. of the Workshop on Logic Programming, Debrecen, 1980."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"M.M.T. Chakravarty and H.C.R. Lock. The Implementation of Lazy Narrowing. In Proc. of the 3rd Int. Symposium on Programming Language Implementation and Logic Programming, pp. 123\u2013134. Springer LNCS 528, 1991.","DOI":"10.1007\/3-540-54444-5_93"},{"key":"3_CR5","unstructured":"D. DeGroot and G. Lindstrom, editors. Logic Programming, Functions, Relations, and Equations. Prentice Hall, 1986."},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pp. 243\u2013320. Elsevier, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"M. Ducass\u00e9. A general trace query mechanism based on Prolog. In Proc. of the 4th International Symposium on Programming Language Implementation and Logic Programming, pp. 400\u2013414. Springer LNCS 631, 1992.","DOI":"10.1007\/3-540-55844-6_150"},{"key":"3_CR8","unstructured":"M. Eisenstadt. A Powerful Prolog Trace Package. In Advances in Artificial Intelligence, pp. 149\u2013158. Elsevier Science Publishers, 1985."},{"key":"3_CR9","first-page":"161","volume-title":"First-Order Unification in an Equational Theory","author":"M.J. Fay","year":"1979","unstructured":"M.J. Fay. First-Order Unification in an Equational Theory. In Proc. 4th Workshop on Automated Deduction, pp. 161\u2013167, Austin (Texas), 1979. Academic Press."},{"key":"3_CR10","unstructured":"L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In Proc. IEEE Internat. Symposium on Logic Programming, pp. 172\u2013184, Boston, 1985."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"M. Hanus. Compiling Logic Programs with Equality. In Proc. of the 2nd Int. Workshop on Programming Language Implementation and Logic Programming, pp. 387\u2013401. Springer LNCS 456, 1990.","DOI":"10.1007\/BFb0024197"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"M. Hanus. Efficient Implementation of Narrowing and Rewriting. In Proc. Int. Workshop on Processing Declarative Knowledge, pp. 344\u2013365. Springer LNAI 567, 1991.","DOI":"10.1007\/BFb0013543"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"M. Hanus. Improving Control of Logic Programs by Using Functional Logic Languages. In Proc. of the 4th International Symposium on Programming Language Implementation and Logic Programming, pp. 1\u201323. Springer LNCS 631, 1992.","DOI":"10.1007\/3-540-55844-6_124"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"M. Hanus. Incremental Rewriting in Narrowing Derivations. In Proc. of the 3rd International Conference on Algebraic and Logic Programming, pp. 228\u2013243. Springer LNCS 632, 1992.","DOI":"10.1007\/BFb0013829"},{"key":"3_CR15","unstructured":"M. Hanus. On the Completeness of Residuation. In Proc. of the 1992 Joint International Conference and Symposium on Logic Programming, pp. 192\u2013206. MIT Press, 1992."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"S. H\u00f6lldobler. Foundations of Equational Logic Programming. Springer LNCS 353, 1989.","DOI":"10.1007\/BFb0015791"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"J.-M. Hullot. Canonical Forms and Unification. In Proc. 5th Conference on Automated Deduction, pp. 318\u2013334. Springer LNCS 87, 1980.","DOI":"10.21236\/ADA087640"},{"key":"3_CR18","unstructured":"B. Josephs. The development of a debugger for the functional logic language ALF (in German). Diploma thesis, Univ. Dortmund, 1992."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"H. Kuchen, R. Loogen, J.J. Moreno-Navarro, and M. Rodr\u00edguez-Artalejo. Graph-based Implementation of a Functional Logic Language. In Proc. ESOP 90, pp. 271\u2013290. Springer LNCS 432, 1990.","DOI":"10.1007\/3-540-52592-0_69"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"R. Loogen. From Reduction Machines to Narrowing Machines. In Proc. of the TAPSOFT '91, pp. 438\u2013457. Springer LNCS 494, 1991.","DOI":"10.1007\/3540539816_80"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"A. M\u00fcck. Compilation of Narrowing. In Proc. of the 2nd Int. Workshop on Programming Language Implementation and Logic Programming, pp. 16\u201329. Springer LNCS 456, 1990.","DOI":"10.1007\/BFb0024173"},{"key":"3_CR22","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(89)80014-8","volume":"7","author":"W. Nutt","year":"1989","unstructured":"W. Nutt, P. R\u00e9ty, and G. Smolka. Basic Narrowing Revisited. Journal of Symbolic Computation, Vol. 7, pp. 295\u2013317, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"P. Padawitz. Computing in Horn Clause Theories, volume 16 of EATCS Monographs on Theoretical Computer Science. Springer, 1988.","DOI":"10.1007\/978-3-642-73824-1"},{"key":"3_CR24","unstructured":"D. Plummer. Coda: An Extended Debugger for PROLOG. In Proc. 5th Conference on Logic Programming & 5th Symposium on Logic Programming (Seattle), pp. 496\u2013511. MIT Press, 1988."},{"key":"3_CR25","unstructured":"U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. IEEE Internat. Symposium on Logic Programming, pp. 138\u2013151, Boston, 1985."},{"issue":"No.10","key":"3_CR26","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/spe.4380201003","volume":"20","author":"A. Schleiermacher","year":"1990","unstructured":"A. Schleiermacher and J.F.H. Winkler. The Implementation of ProTest a Prolog-Debugger for a Refined Box Model. Software-Practice & Experience, Vol. 20, No. 10, pp. 985\u20131006, 1990.","journal-title":"Software-Practice & Experience"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"A.P. Tolmach and A.W. Appel. Debugging Standard ML Without Reverse Engineering. In Proc. ACM Lisp and Functional Programming Conference '90, pp. 1\u201312, Nice, 1990.","DOI":"10.1145\/91556.91564"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"D. Wolz. Design of a Compiler for Lazy Pattern Driven Narrowing. In Recent Trends in Data Type Specification, pp. 362\u2013379. Springer LNCS 534, 1990.","DOI":"10.1007\/3-540-54496-8_19"}],"container-title":["Lecture Notes in Computer Science","Progamming Language Implementation and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57186-8_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:09:01Z","timestamp":1605629341000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57186-8_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571865","9783540479451"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-57186-8_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}