{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:22:03Z","timestamp":1725456123845},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603597"},{"type":"electronic","value":"9783540450481"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0026814","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:29:45Z","timestamp":1132378185000},"page":"63-80","source":"Crossref","is-referenced-by-count":0,"title":["A verified implementation of narrowing"],"prefix":"10.1007","author":[{"given":"Heinz","family":"Fa\u00dfbender","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"S. Antoy, R. Echahed, and M. Hanus. A needed narrowing strategy. In POPL'94, pages 268\u2013279. Portland, 1994.","DOI":"10.1145\/174675.177899"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"L. Augustsson. A compiler for lazy ML. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 218\u2013227, 1984.","DOI":"10.1145\/800055.802038"},{"key":"6_CR3","unstructured":"E. B\u00f6rger, F. Lopez-Fraguas, and M. Rodriguez-Artalejo. A model for mathematical analysis of functional logic languages and their implementations. In IFIP'94, Vol. I, pages 410\u2013415. IFIP Transactions A-51, 1994. North-Holland."},{"key":"6_CR4","unstructured":"E. B\u00f6rger and D. Rosenzweig. The WAM \u2014 definition and compiler correctness. Technical Report TR-14\/92, Dipartimento di Informatica, Universita di Pisa, 1992."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"R. Echahed. On completeness of narrowing strategies. In CAAP'88, pages 89\u2013101. Springer-Verlag, 1988. LNCS 299.","DOI":"10.1007\/BFb0026098"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(91)90353-4","volume":"78","author":"J. Engelfriet","year":"1991","unstructured":"J. Engelfriet and H. Vogler. Modular tree transducers. Theoretical Computer Science, 78:267\u2013304, 1991.","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","unstructured":"H. Fa\u00dfbender. E-Unifikation f\u00fcr primitiv-rekursive Baumfunktionen. PhD thesis, Universit\u00e4t Ulm, Fakult\u00e4t f\u00fcr Informatik, M\u00e4rz 1995."},{"issue":"3","key":"6_CR8","first-page":"139","volume":"11","author":"H. Fa\u00dfbender","year":"1994","unstructured":"H. Fa\u00dfbender and H. Vogler. A universal unification algorithm based on unification-driven leftmost outermost narrowing. Acta Cybernetica, 11(3):139\u2013167, 1994.","journal-title":"Acta Cybernetica"},{"key":"6_CR9","unstructured":"M. Fay. First-order unification in an equational theory. In Proceeding of the 4th workshop on automated deduction, Austin, pages 161\u2013167, 1979."},{"key":"6_CR10","first-page":"264","volume":"43","author":"Y. Gurevich","year":"1991","unstructured":"Y. Gurevich. Evolving algebras. A tutorial introduction. Bulletin of the EATCS, 43:264\u2013284, 1991.","journal-title":"Bulletin of the EATCS"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"W. Hans, R. Loogen, and S. Winkler. On the interaction of lazy evaluation and backtracking. In PLILP'92, pages 355\u2013369. Springer-Verlag, 1992. LNCS 631.","DOI":"10.1007\/3-540-55844-6_147"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19","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:583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"J.M. Hullot. Canonical forms and unification. In Proceedings of the 5th conference on automated deduction, pages 318\u2013334. Springer-Verlag, 1980. LNCS 87.","DOI":"10.21236\/ADA087640"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/502949.502880","volume":"6","author":"T. Johnsson","year":"1984","unstructured":"T. Johnsson. Efficient compilation of lazy evaluation. SIGPLAN Notices, 6:58\u201369, 1984.","journal-title":"SIGPLAN Notices"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"H. Kuchen, R. Loogen, J.J. Moreno-Navarro, and M. Rodriguez-Artalejo. Graphbased implementation of a functional logic language. In ESOP'90, pages 271\u2013290. Springer-Verlag, 1990. LNCS 432.","DOI":"10.1007\/3-540-52592-0_69"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"D. Lester. The G-Machine as a representation of stack semantics. In Functional Programming Languages and Computer Architecture, pages 46\u201359. Springer-Verlag, 1987. LNCS 274.","DOI":"10.1007\/3-540-18317-5_4"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"J.J. Moreno-Navarro, H. Kuchen, R. Loogen, and M. Rodriguez-Artalejo. Lazy narrowing in a graph machine. In ALP'90, pages 298\u2013317. Springer-Verlag, 1990. LNCS 463.","DOI":"10.1007\/3-540-53162-9_47"},{"key":"6_CR18","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. Rodriguez-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":"6_CR19","unstructured":"A. M\u00fcck. CAMEL: an extension of the categorical abstract machine to compile functional\/logic programs. In PLILP'92. Springer-Verlag, 1992. LNCS 631."},{"key":"6_CR20","unstructured":"A. M\u00fcck. CAMEL: a verified abstract machine for functional logic programming. In A. M\u00fcck, editor, Proceedings of the Second International Workshop on Functional\/ Logic Programming. University of Munich, Number 9311, 1993."},{"key":"6_CR21","unstructured":"Rinus Plasmeijer and Marko van Eekelen. Functional Programming and Parallel Graph Rewriting. International Computer Science Series. Addison Wesley, 1993."},{"key":"6_CR22","unstructured":"U.S. Reddy. Narrowing as the operational semantics of functional languages. In Symposium on Logic Programming, pages 138\u2013151. IEEE Comp. Soc. Press, 1985."},{"key":"6_CR23","unstructured":"D.H.D. Warren. An abstract prolog instruction set. Technical Report 309, SRI International, 1983."},{"key":"6_CR24","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0747-7171(89)80015-X","volume":"7","author":"J.H. You","year":"1989","unstructured":"J.H. You. Enumerating outer narrowing derivations for constructor-based term rewriting systems. Journal of Symbolic Computation, 7:319\u2013341, 1989.","journal-title":"Journal of Symbolic Computation"}],"container-title":["Lecture Notes in Computer Science","Programming Languages: Implementations, Logics and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026814","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:54:04Z","timestamp":1586555644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603597","9783540450481"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/bfb0026814","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}