{"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":1782422659118,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540672814","type":"print"},{"value":"9783540464211","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10720084_12","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T14:36:30Z","timestamp":1167402990000},"page":"171-185","source":"Crossref","is-referenced-by-count":28,"title":["Compiling Multi-paradigm Declarative Programs into Prolog"],"prefix":"10.1007","author":[{"given":"Sergio","family":"Antoy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Hanus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/3-540-47849-3_20","volume-title":"SOFSEM\u201999: Theory and Practice of Informatics","author":"M. Alpuente","year":"1999","unstructured":"Alpuente, M., Escobar, S., Lucas, S.: UPV-Curry: an Incremental Curry Interpreter. In: Bartosek, M., Tel, G., Pavelka, J. (eds.) SOFSEM 1999. LNCS, vol.\u00a01725, pp. 327\u2013335. Springer, Heidelberg (1999)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Antoy, S.: Non-Determinism and Lazy Evaluation in Logic Programming. In: Proc. Int. Workshop on Logic Program Synthesis and Transformation (LOPSTR 1991), pp. 318\u2013331. Springer Workshops in Computing (1991)","DOI":"10.1007\/978-1-4471-3494-7_23"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Algebraic and Logic Programming","author":"S. Antoy","year":"1992","unstructured":"Antoy, S.: Definitional Trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 143\u2013157. Springer, Heidelberg (1992)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Antoy, S.: Needed Narrowing in Prolog. Technical Report 96-2, Portland State University (1996)","DOI":"10.1007\/3-540-61756-6_106"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A Needed Narrowing Strategy. Journal of the ACM (to appear). Previous version in Proc. 21st ACM Symposium on Principles of Programming Languages, pp. 268\u2013279 (1994)","DOI":"10.1145\/174675.177899"},{"key":"12_CR6","unstructured":"Byrd, L.: Understanding the Control Flow of Prolog Programs. In: Proc. of the Workshop on Logic Programming, Debrecen (1980)"},{"key":"12_CR7","unstructured":"Caballero-Rold\u00e1n, R., S\u00e1nchez-Hern\u00e1ndez, J., L\u00f3pez-Fraguas, F.J.: User\u2019s Manual for TOY. Technical Report SIP 97\/57, Universidad Complutense de Madrid (1997)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Cheong, P.H., Fribourg, L.: Implementation of Narrowing: The Prolog-Based Approach. In: Apt, K.R., de Bakker, J.W., Rutten, J.J.M.M. (eds.) Logic programming languages: constraints, functions and objects, pp. 1\u201320. MIT Press, Cambridge (1993)","DOI":"10.7551\/mitpress\/4313.003.0004"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0022-0000(91)90009-T","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"Giovannetti, E., Levi, G., Moiso, C., Palamidessi, C.: Kernel LEAF: A Logic plus Functional Language. Journal of Computer and System Sciences\u00a042(2), 139\u2013185 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19&20","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming\u00a019&20, 583\u2013628 (1994)","journal-title":"Journal of Logic Programming"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-60939-3_19","volume-title":"Proc. Fifth International Workshop on Logic Program Synthesis and Transformation","author":"M. Hanus","year":"1996","unstructured":"Hanus, M.: Efficient Translation of Lazy Functional Logic Programs into Prolog. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol.\u00a01048, pp. 252\u2013266. Springer, Heidelberg (1996)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Hanus, M.: A Unified Computation Model for Functional and Logic Programming. In: Proc. of the 24th ACM Symposium on Principles of Programming Languages, pp. 80\u201393 (1997)","DOI":"10.1145\/263699.263710"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/10704567_11","volume-title":"Principles and Practice of Declarative Programming","author":"M. Hanus","year":"1999","unstructured":"Hanus, M.: Distributed Programming in a Multi-Paradigm Declarative Language. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 376\u2013395. Springer, Heidelberg (1999)"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1017\/S0956796899003330","volume":"9","author":"M. Hanus","year":"1999","unstructured":"Hanus, M., Prehofer, C.: Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming\u00a09(1), 33\u201375 (1999)","journal-title":"Journal of Functional Programming"},{"key":"12_CR15","unstructured":"Hanus, M., R\u00e9ty, P.: Demand-driven Search in Functional Logic Programs. Research Report RR-LIFO-98-08, Univ. Orl\u00e9ans (1998)"},{"key":"12_CR16","unstructured":"Hanus, M., Sadre, R.: An Abstract Machine for Curry and its Concurrent Implementation in Java. Journal of Functional and Logic Programming\u00a01999(6) (1999)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BFb0056627","volume-title":"Principles of Declarative Programming","author":"M. Hanus","year":"1998","unstructured":"Hanus, M., Steiner, F.: Controlling Search in Declarative Programs. In: Palamidessi, C., Meinke, K., Glaser, H. (eds.) ALP 1998 and PLILP 1998. LNCS, vol.\u00a01490, pp. 374\u2013390. Springer, Heidelberg (1998)"},{"key":"12_CR18","unstructured":"Hanus, M. (ed.): Curry: An Integrated Functional Logic Language, Vers. 0.6 (1999), available at http:\/\/www-i2.informatik.rwth-aachen.de\/~hanus\/curry"},{"key":"12_CR19","first-page":"167","volume-title":"Proc. 1991 Int. Logic Programming Symposium","author":"S. Janson","year":"1991","unstructured":"Janson, S., Haridi, S.: Programming Paradigms of the Andorra Kernel Language. In: Proc. 1991 Int. Logic Programming Symposium, pp. 167\u2013183. MIT Press, Cambridge (1991)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Jim\u00e9nez-Martin, J.A., Marino-Carballo, J., Moreno-Navarro, J.J.: Efficient Compilation of Lazy Narrowing into Prolog. In: Proc. Int. Workshop on Logic Program Synthesis and Transformation (LOPSTR 1992). Springer Workshops in Computing Series, pp. 253\u2013270 (1992)","DOI":"10.1007\/978-1-4471-3560-9_18"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-57186-8_79","volume-title":"Programming Language Implementation and Logic Programming","author":"R. Loogen","year":"1993","unstructured":"Loogen, R., Lopez Fraguas, F., Rodrhb\u00f3xiguez Artalejo, M.: A Demand Driven Computation Strategy for Lazy Narrowing. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol.\u00a0714, pp. 184\u2013200. Springer, Heidelberg (1993)"},{"key":"12_CR22","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., Rodrhb\u00f3xiguez-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":"12_CR23","unstructured":"Naish, L. (ed.): Negation and Control in Prolog. LNCS, vol.\u00a0238. Springer, Heidelberg (1987)"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-54444-5_84","volume-title":"Programming Language Implementation and Logic Programming","author":"L. Naish","year":"1991","unstructured":"Naish, L.: Adding equations to NU-Prolog. In: Ma\u0142uszy\u0144ski, J., Wirsing, M. (eds.) PLILP 1991. LNCS, vol.\u00a0528, pp. 15\u201326. Springer, Heidelberg (1991)"},{"key":"12_CR25","unstructured":"Peterson, J., et al.: Haskell: A Non-strict, Purely Functional Language (Version 1.4). Technical Report, Yale University (1997)"},{"key":"12_CR26","volume-title":"The Implementation of Functional Programming Languages","author":"S.L. Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice Hall, Englewood Cliffs (1987)"},{"key":"12_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2086.001.0001","volume-title":"Concurrent Constraint Programming","author":"V.A. Saraswat","year":"1993","unstructured":"Saraswat, V.A.: Concurrent Constraint Programming. MIT Press, Cambridge (1993)"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"Smolka, G.: The Oz Programming Model. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol.\u00a01000, pp. 324\u2013343. Springer, Heidelberg (1995)"},{"issue":"3","key":"12_CR29","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1145\/262009.262011","volume":"29","author":"P. Wadler","year":"1997","unstructured":"Wadler, P.: How to Declare an Imperative. ACM Computing Surveys\u00a029(3), 240\u2013263 (1997)","journal-title":"ACM Computing Surveys"},{"key":"12_CR30","first-page":"441","volume":"10","author":"D.H.D. Warren","year":"1982","unstructured":"Warren, D.H.D.: Higher-order extensions to PROLOG: are they needed? Machine Intelligence\u00a010, 441\u2013454 (1982)","journal-title":"Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10720084_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T18:57:14Z","timestamp":1736708234000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10720084_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672814","9783540464211"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/10720084_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}