{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:09:57Z","timestamp":1768453797618,"version":"3.49.0"},"reference-count":46,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0022-0000(91)90009-t","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"139-185","source":"Crossref","is-referenced-by-count":66,"title":["Kernel-LEAF: A logic plus functional language"],"prefix":"10.1016","volume":"42","author":[{"given":"Elio","family":"Giovannetti","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Levi","sequence":"additional","affiliation":[]},{"given":"Corrado","family":"Moiso","sequence":"additional","affiliation":[]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(91)90009-T_BIB1","article-title":"Introduction to Logic Programming","author":"Apt","year":"1987"},{"key":"10.1016\/0022-0000(91)90009-T_BIB45","unstructured":"Handbook of Theoretical Computer Science, North-Holland, Amsterdam, to appear."},{"key":"10.1016\/0022-0000(91)90009-T_BIB2","series-title":"Proc. 1984 Int. Symp. on Logic Programming","first-page":"160","article-title":"On the integration of logic programming and functional programming","author":"Barbuti","year":"1984"},{"key":"10.1016\/0022-0000(91)90009-T_BIB3","series-title":"Logic Programming: Functions, Relations and Equations","first-page":"201","article-title":"LEAF: A language which integrates logic, equations and functions","author":"Barbuti","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB4","series-title":"The Lambda-Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/0022-0000(91)90009-T_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/0743-1066(86)90014-2","article-title":"The Relation between Logic and Functional Languages","author":"Bellia","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(86)90014-2","article-title":"The relation between logic and functional languages: A survey","volume":"3","author":"Bellia","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(91)90009-T_BIB7","series-title":"Proc. Conference on Parallel Architectures and Languages Europe (PARLE)","first-page":"374","article-title":"A two level approach to logic plus functional programming integration","author":"Bellia","year":"1987"},{"key":"10.1016\/0022-0000(91)90009-T_BIB8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0022-0000(86)90033-4","article-title":"Conditional rewrite rules: Confluence and termination","volume":"32","author":"Bergstra","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(91)90009-T_BIB9","series-title":"Proc. 1986 Symp. on Logic Programming","first-page":"89","article-title":"IDEAL, An ideal deductive applicative language","author":"Bosco","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB10","series-title":"Foundations of Logic and Functional Programming","first-page":"157","article-title":"A completeness result for a semantic unification algorithm based on conditional narrowing","volume":"Vol. 306","author":"Bosco","year":"1987"},{"key":"10.1016\/0022-0000(91)90009-T_BIB11","series-title":"Proc. AIMSA '86","article-title":"A Prolog-compiled higher-order functional and logic language","author":"Bosco","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB12_1","series-title":"Proc. TAPSOFT '87","first-page":"276","article-title":"Refined strategies for semantic unification","volume":"Vol. 150","author":"Bosco","year":"1987"},{"key":"10.1016\/0022-0000(91)90009-T_BIB12_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(88)90095-3","article-title":"Refined strategies for semantic unification","volume":"59","author":"Bosco","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(91)90009-T_BIB13","series-title":"Proc. Sixth Conf. on Logic Programming","first-page":"318","article-title":"An extension of WAM for K-LEAF: A WAM-based compilation of conditional narrowing","author":"Bosco","year":"1989"},{"key":"10.1016\/0022-0000(91)90009-T_BIB14","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1137\/0204036","article-title":"Proving theorems with the modification method","volume":"4","author":"Brand","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(91)90009-T_BIB15","series-title":"Logic and Data Bases","first-page":"293","article-title":"Negation as failure","author":"Clark","year":"1978"},{"key":"10.1016\/0022-0000(91)90009-T_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/5001.5390","article-title":"PARLOG: Parallel programming in logic","volume":"8","author":"Clark","year":"1986","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"10.1016\/0022-0000(91)90009-T_BIB17","series-title":"Proc. 1985 Symp. on Logic Programming","first-page":"220","article-title":"Surface deduction: A uniform mechanism for logic programming","author":"Cox","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB18","series-title":"Proc. 1985 Symp. on Logic Programming","first-page":"54","article-title":"Logic programming cum applicative programming","author":"Dershowitz","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB19","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"Van Emden","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(91)90009-T_BIB20","unstructured":"M. Fay, First order unification in an equational theory, in \u201cProc. 4th Workshop on Automated Deduction,\u201d 161\u2013167."},{"key":"10.1016\/0022-0000(91)90009-T_BIB21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0743-1066(84)90003-7","article-title":"Oriented equational clauses as a programming language","volume":"1","author":"Fribourg","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(91)90009-T_BIB22","series-title":"Proc. 1985 Symp. on Logic Programming","first-page":"172","article-title":"SLOG: A logic programming language interpreter based on clausal superposition and rewriting","author":"Fribourg","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB23","article-title":"Kernel LEAF: An Experimental Logic plus Functional Language-Its Syntax, Semantics and Computational Model","author":"Giovannetti","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB24","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(91)90009-T_BIB25","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(84)90004-9","article-title":"Equality, types, modules and (why not?) generics for logic programming","volume":"1","author":"Goguen","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(91)90009-T_BIB26","series-title":"Logic Programming: Functions, Relations and Equations","first-page":"295","article-title":"Quality, types and generic modules for logic programming","author":"Goguen","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB27","series-title":"Proc. IFIP '86","first-page":"995","article-title":"One, none, a hundred thousand specification languages","author":"Goguen","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB28","series-title":"Formal structures for computation and deduction","author":"Huet","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB29","series-title":"Proc. 5th Conf. on Automated Deduction","first-page":"318","article-title":"Canonical forms and unification","volume":"Vol. 87","author":"Hullot","year":"1980"},{"key":"10.1016\/0022-0000(91)90009-T_BIB30","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-15984-3_328","article-title":"Unification in Conditional-Equational Theories","author":"Hussmann","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB31","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(84)90010-4","article-title":"A theory of complete logic programs with equality","volume":"1","author":"Jaffar","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0022-0000(91)90009-T_BIB32","series-title":"Logic Programming: Functions, Relations and Equations","first-page":"441","article-title":"A logic programming language scheme","author":"Jaffar","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB33","series-title":"Proc. of Third Int'l Conf. on Logic Programming","first-page":"223","article-title":"Some issues and trends in the semantics of logic programming","volume":"Vol. 225","author":"Jaffar","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB34","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0304-3975(85)90128-8","article-title":"Optimal fixedpoints of logic programs","volume":"39","author":"Lassez","year":"1985","journal-title":"Theoret. Compul. Sci."},{"key":"10.1016\/0022-0000(91)90009-T_BIB35","series-title":"Proc. 1987 Symp. on Logic Programming","first-page":"318","article-title":"A complete semantics characterization of K-LEAF, a logic language with partial functions","author":"Levi","year":"1987"},{"key":"10.1016\/0022-0000(91)90009-T_BIB36","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0022-0000(91)90009-T_BIB37","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09691-8_11","article-title":"Fair Conditional Term Rewriting Systems: Unification, Termination, and Confluence","author":"Kaplan","year":"1984"},{"key":"10.1016\/0022-0000(91)90009-T_BIB38","series-title":"Working material for the seminar on reduction machines","author":"Klop","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB39","series-title":"Logic Programming: Functions, Relations and Equations","first-page":"279","article-title":"Equality for PROLOG","author":"Kornfeld","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB40","series-title":"Proc. 1985 Symp. on Logic Programming","first-page":"138","article-title":"Narrowing as the operational semantics of functional languages","author":"Reddy","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB41","series-title":"Logic Programming: Functions, Relations and Equations","first-page":"3","article-title":"On the relationship between logic and functional languages","author":"Reddy","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB42","series-title":"Proc. First Int. Conf. on Rewriting Techniques and Applications","first-page":"141","article-title":"NARROWER: A new algorithm for unification and its application to logic programming","volume":"Vol. 202","author":"Rety","year":"1985"},{"key":"10.1016\/0022-0000(91)90009-T_BIB43","series-title":"Logic Programming: Functions, Relations and Equations","first-page":"157","article-title":"FUNLOG: A computational model integrating logic programming and functional programming","author":"Subrahmanyam","year":"1986"},{"key":"10.1016\/0022-0000(91)90009-T_BIB44","series-title":"Proc. of the 1984 Symp. on Logic Programming","first-page":"259","article-title":"Semantics of a logic programming language with a reducibility predicate","author":"Tamaki","year":"1984"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190009T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009190009T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:56:13Z","timestamp":1550307373000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009190009T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["002200009190009T"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(91)90009-t","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}