{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:21Z","timestamp":1725663441876},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540179436"},{"type":"electronic","value":"9783540471448"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17943-7_140","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:19:35Z","timestamp":1330197575000},"page":"374-393","source":"Crossref","is-referenced-by-count":5,"title":["A two-level approach to logic plus functional programming integration"],"prefix":"10.1007","author":[{"given":"M.","family":"Bellia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. G.","family":"Bosco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Giovannetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Levi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Moiso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Palamidessi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"24_CR1","unstructured":"R. Barbuti, M. Bellia, G. Levi and M. Martelli, On the integration of logic programming and functional programming, Proc. 1984 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 160\u2013166."},{"key":"24_CR2","unstructured":"R. Barbuti, M. Bellia, G. Levi and M. Martelli, LEAF: A language which integrates logic, equations and functions, in Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds. (Prentice-Hall, 1986), 201\u2013238."},{"key":"24_CR3","unstructured":"M. Bellia, E. Giovannetti, G. Levi and C. Moiso, The relation between logic and functional languages, ESPRIT Project 415, First year report (1985)."},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","volume":"3","author":"M. Bellia","year":"1986","unstructured":"M. Bellia and G. Levi, The relation between logic and functional languages: A survey, Journal of Logic Programming 3 (1986),217\u2013236.","journal-title":"Journal of Logic Programming"},{"key":"24_CR5","unstructured":"P.G. Bosco and E. Giovannetti, IDEAL: An Ideal DEductive Applicative Language, Proc. 1986 Symp. on Logic Programming (IEEE Comp. Society Press, 1986), 89\u201394."},{"key":"24_CR6","unstructured":"P.G. Bosco, E. Giovannetti and C. Moiso, A completeness result for a semantic unification algorithm based on conditional narrowing, to appear in Proc. Foundations of Logic and Functional Programming (Trento 15\u201319 December 1986)."},{"key":"24_CR7","unstructured":"P.G. Bosco and E. Giovannetti, A Prolog-compiled higher-order functional and logic language, to appear in Proc. AIMSA '86 (North-Holland, 1986)."},{"key":"24_CR8","unstructured":"P.G. Bosco, E. Giovannetti and C. Moiso, Refined strategies for semantic unification, to appear in Proc. TAPSOFT '87 (Springer-Verlag, 1987)."},{"key":"24_CR9","unstructured":"P.G. Bosco, E. Giovannetti, G. Levi, C. Moiso and C. Palamidessi, A complete semantic characterization of K-LEAF, a logic language with partial functions, submitted for publication (1987)."},{"key":"24_CR10","unstructured":"P.G. Bosco, E. Giachin, G. Giandonato, G. Martinengo and C. Rullent, A parallel architecture for signal understanding through inference on uncertain data, these Proceedings."},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1137\/0204036","volume":"4","author":"D. Brand","year":"1975","unstructured":"D. Brand, Proving theorems with the modification method, SIAM J. Comput. 4 (1975), 412\u2013430.","journal-title":"SIAM J. Comput."},{"key":"24_CR12","unstructured":"N. Dershowitz and D.A. Plaisted, Logic Programming cum Applicative Programming, Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 54\u201366."},{"key":"24_CR13","unstructured":"L. Fribourg, SLOG: A logic programming language interpreter based on clausal superposition and rewriting, Proc. 1985 Symp. on Logic Programming (IEEE Comp. Society Press, 1985), 172\u2013184."},{"key":"24_CR14","unstructured":"G. Giandonato and G. Sofi, Parallelizing Prolog-based inference engines, ESPRIT Project 26, T4.3 Techn. Rep. (Sept. 1986)."},{"key":"24_CR15","unstructured":"E. Giovannetti and C. Moiso, Some aspects of the integration between logic programming and functional programming, to appear in Proc. of AIMSA '86 (North-Holland)."},{"key":"24_CR16","unstructured":"E.Giovannetti, G. Levi, C. Moiso and C. Palamidessi, Kernel LEAF: an experimental logic plus functiona language \u2014 its syntax, semantics and computational model, ESPRIT Project 415, Second year report (1986)."},{"key":"24_CR17","unstructured":"J.A. Goguen and J. Meseguer, Equality, types and generic modules for logic programming, in Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds. (Prentice-Hall, 1986), 295\u2013364."},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","volume":"13","author":"W. Goldfarb","year":"1981","unstructured":"W. Goldfarb, The undecidability of the second order unification problem, Theoretical Computer Science 13 (1981), 225\u2013230.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"24_CR19","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/15022.15023","volume":"21","author":"J. Heering","year":"1986","unstructured":"J. Heering and P. Klint, The efficiency of the equation interpreter compared with the UNH Prolog interpreter, SIGPLAN Notices 21, n. 2 (ACM, 1986), 18\u201321.","journal-title":"SIGPLAN Notices"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"S. Holld\u00f6bler, A Unification Algorithm for Confluent Theories, Personal Communication (1986).","DOI":"10.1007\/3-540-18088-5_4"},{"key":"24_CR21","unstructured":"G. Huet, Resolution d'equations dans les languages d'ordre 1,2,...omega, These de Doctorat d'Etat, Universit' Paris VII (1976)."},{"key":"24_CR22","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-15975-4_37","volume":"201","author":"T. Johnsson","year":"1985","unstructured":"T. Johnsson, Lambda-lifting: Transforming Programs to Recursive Equations, Proc. of Int. Conf. of Functional Programming Languages and Architectures, LNCS 201 (Springer-Verlag, 1985), 190\u2013203.","journal-title":"Proc. of Int. Conf. of Functional Programming Languages and Architectures, LNCS"},{"key":"24_CR23","unstructured":"J.W.Klop, Term Rewriting Systems, Notes for the Summer Workshop on Reduction Machines (Ustica, 1985)."},{"key":"24_CR24","unstructured":"A. Martelli, C. Moiso and G.F. Rossi, Lazy unification algorithms for canonical rewrite systems, to appear in Proc. of Colloquium on Resolution of Equations in Algebraic Structures, Lakeway, May 4\u20136 (Prentice-Hall)."},{"key":"24_CR25","first-page":"448","volume":"225","author":"D. Miller","year":"1986","unstructured":"D. Miller and G. Nadathur, Higher-Order Logic Programming, Proc. of Third Int. Conf on Logic Programming, LNCS 225 (Springer-Verlag, 1986), 448\u2013462.","journal-title":"Proc. of Third Int. Conf on Logic Programming, LNCS"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"M. O'Donnell, Equational Logic as a Programming Language, (M.I.T. Press, 1985), 54\u201362.","DOI":"10.1007\/3-540-15648-8_20"},{"issue":"2","key":"24_CR27","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0214028","volume":"14","author":"G. Revesz","year":"1985","unstructured":"G. Revesz, Axioms for the theory of Lambda-conversion, SIAM J. COMP. vol.14, n.2 (May 1985), 373\u2013382.","journal-title":"SIAM J. COMP."},{"key":"24_CR28","unstructured":"P.A. Subrahmanyam and J.-H. You, FUNLOG: A computational model integrating logic programming and functional programming, in Logic Programming: Functions, Relations and Equations, D. DeGroot and G. Lindstrom, Eds. (Prentice-Hall, 1986), 157\u2013198."},{"key":"24_CR29","unstructured":"H. Tamaki, Semantics of a logic programming language with a reducibility predicate, Proc. 1984 Int. Symp. on Logic Programming (IEEE Comp. Society Press, 1984), 259\u2013264."},{"key":"24_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-15975-4_26","volume":"201","author":"D.A. Turner","year":"1985","unstructured":"D.A. Turner, MIRANDA: a non-strict functional language with polymorphic types, Proc. of Int. Conf. of Functional Programming Languages and Architectures, LNCS 201(Springer-Verlag, 1985), 1\u201316.","journal-title":"Proc. of Int. Conf. of Functional Programming Languages and Architectures, LNCS"},{"key":"24_CR31","first-page":"441","volume":"10","author":"D. H. D. Warren","year":"1982","unstructured":"D. H. D. Warren, Higher order extensions to Prolog. Are they needed?, Machine Intelligence 10 (Ellis Horwood, 1982), 441\u2013454.","journal-title":"Machine Intelligence"},{"key":"24_CR32","unstructured":"D. H. D. Warren, An abstract Prolog Instruction Set, Technical Note 309, SRI International (Oct. 1983)."},{"key":"24_CR33","first-page":"454","volume":"226","author":"J.-H. You","year":"1986","unstructured":"J.-H. You and P.A. Subrahmanyam, E-unification algorithms for a class of confluent term rewriting systems, Proc. ICALP'86, LNCS 226 (Springer-Verlag, 1986), 454\u2013463.","journal-title":"Proc. ICALP'86, LNCS"}],"container-title":["Lecture Notes in Computer Science","PARLE Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17943-7_140.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:35Z","timestamp":1605644015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17943-7_140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540179436","9783540471448"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-17943-7_140","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}