{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:12:16Z","timestamp":1767928336214,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540666776","type":"print"},{"value":"9783540479505","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10705424_23","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T19:25:50Z","timestamp":1167333950000},"page":"353-368","source":"Crossref","is-referenced-by-count":1,"title":["A Semantics for Program Analysis in Narrowing-Based Functional Logic Languages"],"prefix":"10.1007","author":[{"given":"Michael","family":"Hanus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvador","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","volume":"1","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: Abstract Interpretation, Logical Relations and Kan Extensions. Journal of Logic and Computation\u00a01(1), 5\u201340 (1990)","journal-title":"Journal of Logic and Computation"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: Domain Theory in Logic Form. Annals of Pure and Applied Logic\u00a051, 1\u201377 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0743-1066(94)00024-Z","volume":"22","author":"M. Alpuente","year":"1995","unstructured":"Alpuente, M., Falaschi, M., Manzo, F.: Analyses of Unsatisfiability for Equational Logic Programming. Journal of Logic Programming\u00a022(3), 221\u2013252 (1995)","journal-title":"Journal of Logic Programming"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/174675.177899","volume-title":"Conference Record of the ACM Symposium on Principles of Programming Languages, POPL 1994","author":"S. Antoy","year":"1994","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. In: Conference Record of the ACM Symposium on Principles of Programming Languages, POPL 1994, pp. 268\u2013279. ACM Press, New York (1994)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0304-3975(76)90031-1","volume":"2","author":"J.W. Bakker de","year":"1976","unstructured":"de Bakker, J.W.: Least Fixed Points Revisited. Theoretical Computer Science\u00a02, 155\u2013181 (1976)","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0890-5401(91)90004-L","volume":"90","author":"P. Dybjer","year":"1991","unstructured":"Dybjer, P.: Inverse Image Analysis Generalises Strictness Analysis. Information and Computation\u00a090, 194\u2013216 (1991)","journal-title":"Information and Computation"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J.A. Goguen","year":"1977","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial Algebra Semantics and Continuous Algebras. Journal of the ACM\u00a024(1), 68\u201395 (1977)","journal-title":"Journal of the ACM"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"J.C. Gonz\u00e1lez-Moreno","year":"1999","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. Journal of Logic Programming\u00a040(1), 47\u201387 (1999)","journal-title":"Journal of Logic Programming"},{"key":"23_CR10","volume-title":"Semantics of Programming Languages","author":"C.A. Gunter","year":"1992","unstructured":"Gunter, C.A.: Semantics of Programming Languages. The MIT Press, Cambridge (1992)"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/3-540-57877-3_5","volume-title":"Compiler Construction","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: Towards the Global Optimization of Functional Logic Programs. In: Fritzson, P.A. (ed.) CC 1994. LNCS, vol.\u00a0786, pp. 68\u201382. Springer, Heidelberg (1994)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/263699.263710","volume-title":"Conference Record of the 24th Symposium on Principles of Programming Languages POPL 1997","author":"M. Hanus","year":"1997","unstructured":"Hanus, M.: A Unified Computation Model for Functional and Logic Programming. In: Conference Record of the 24th Symposium on Principles of Programming Languages POPL 1997, pp. 80\u201393. ACM Press, New York (1997)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-58485-4_31","volume-title":"Static Analysis","author":"M. Hanus","year":"1994","unstructured":"Hanus, M., Zartmann, F.: Mode Analysis of Functional Logic Programs. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 26\u201342. Springer, Heidelberg (1994)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"SWAT \u201988","author":"J.-M. Hullot","year":"1988","unstructured":"Hullot, J.-M.: Canonical forms and unification. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318-334, Springer, Heidelberg (1988)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/3-540-57186-8_78","volume-title":"Programming Language Implementation and Logic Programming","author":"J.J. Moreno-Navarro","year":"1993","unstructured":"Moreno-Navarro, J.J., Kuchen, H., Mari\u00f1o, J., Winkler, S., Hans, W.: Efficient Lazy Narrowing using Demandedness Analysis. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol.\u00a0714, pp. 167\u2013183. Springer, Heidelberg (1993)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","volume":"12","author":"J.J. Moreno-Navarro","year":"1992","unstructured":"Moreno-Navarro, J.J., Rodr\u00edguez-Artalejo, M.: Logic programming with functions and predicates: the language BABEL. Journal of Logic Programming\u00a012, 191\u2013223 (1992)","journal-title":"Journal of Logic Programming"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-09981-6_19","volume-title":"International Symposium on Programming","author":"A. Mycroft","year":"1980","unstructured":"Mycroft, A.: The theory and practice of transforming call-by-need into callby- value. In: Robinet, B. (ed.) Programming 1980. LNCS, vol.\u00a083, pp. 269\u2013281. Springer, Heidelberg (1980)"},{"key":"23_CR18","unstructured":"Reddy, U.S.: Narrowing as the Operational Semantics of Functional Languages. In: Proc. of IEEE International Symposium on Logic Programming, pp. 138\u2013151 (1985)"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Automata, Languages, and Programming","author":"D. Scott","year":"1982","unstructured":"Scott, D.: Domains for Denotational Semantics. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 577\u2013613. Springer, Heidelberg (1982)"},{"key":"23_CR20","unstructured":"Scott, D.: Lectures on a mathematical theory of computation. Monograph PRG- 19. Computing Laboratory, Oxford University (1981)"},{"key":"23_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139166386","volume-title":"Mathematical Theory of Domains","author":"V. Stoltenberg-Hansen","year":"1994","unstructured":"Stoltenberg-Hansen, V., Lindstr\u00f6m, I., Griffr, E.R.: Mathematical Theory of Domains. Cambridge University Press, Cambridge (1994)"},{"key":"23_CR22","volume-title":"Topology via Logic","author":"S. Vickers","year":"1989","unstructured":"Vickers, S.: Topology via Logic. Cambridge University Press, Cambridge (1989)"},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BFb0032739","volume-title":"Static Analysis","author":"F. Zartmann","year":"1997","unstructured":"Zartmann, F.: Denotational Abstract Interpretation of Functional Logic Programs. In: Van Hentenryck, P. (ed.) SAS 1997. LNCS, vol.\u00a01302, pp. 141\u2013159. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10705424_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T06:22:24Z","timestamp":1553322144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10705424_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666776","9783540479505"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/10705424_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]}}}