{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:11:28Z","timestamp":1768450288720,"version":"3.49.0"},"reference-count":58,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":9788,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1986,10]]},"DOI":"10.1016\/0743-1066(86)90014-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"217-236","source":"Crossref","is-referenced-by-count":72,"title":["The relation between logic and functional languages: a survey"],"prefix":"10.1016","volume":"3","author":[{"given":"Marco","family":"Bellia","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Levi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(86)90014-2_BIB1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03037050","article-title":"A Prological Definition of hasl, a Purely Functional Language with Unification Based Conditional Binding Expressions","volume":"2","author":"Abramson","year":"1984","journal-title":"New Generation Comput."},{"key":"10.1016\/0743-1066(86)90014-2_BIB2","series-title":"Proceedings of the 1984 International Symposium on Logic Programming","first-page":"160","article-title":"On the integration of logic programming and functional programming","author":"Barbuti","year":"1984"},{"key":"10.1016\/0743-1066(86)90014-2_BIB3","series-title":"Logic Programming: Functions, Relations and Equations","article-title":"leaf: A Language Which Integrates Logic, Equations and Functions","author":"Barbuti","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB4","first-page":"334","article-title":"A Functional Plus Predicate Logic Programming Language","author":"Bellia","year":"1980","journal-title":"Proceedings of the Logic Programming Workshop"},{"key":"10.1016\/0743-1066(86)90014-2_BIB5","series-title":"Logic Programming","first-page":"281","article-title":"The Call by Name Semantics of a Clause Language with Functions","author":"Bellia","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-11494-7_1","article-title":"Applicative Communicating Processes in First Order Logic","author":"Bellia","year":"1982","journal-title":"Proceedings of the 5th International Symposium on Programming, LNCS 137"},{"key":"10.1016\/0743-1066(86)90014-2_BIB7","series-title":"Implementations of prolog","first-page":"309","article-title":"A Formal Model for Lazy Implementation of a prolog Compatible Functional Language","author":"Bellia","year":"1984"},{"key":"10.1016\/0743-1066(86)90014-2_BIB8","series-title":"Highly Parallel Reduction Machine Architecture","article-title":"A Proposal for a Fifth Generation Logic and Functional Programming System","author":"Berkling","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB9","series-title":"Epsilon-reduction: Another View of Unification","author":"Berkling","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB10","series-title":"Logic Programming","first-page":"153","article-title":"Amalgamating Language and Metalanguage in Logic Programming","author":"Bowen","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB11","series-title":"Proceedings of the 1985 Symposium on Logic Programming","first-page":"48","article-title":"A Meta-level Extension of Prolog","author":"Bowen","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB12","first-page":"136","article-title":"hope: An Experimental Applicative Language","author":"Burstall","year":"1980","journal-title":"Conference Record of the 1980 LISP Conference"},{"key":"10.1016\/0743-1066(86)90014-2_BIB13","series-title":"Logic and Data Bases","first-page":"292","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(86)90014-2_BIB14","first-page":"171","article-title":"A Relational Language for Parallel Programming","author":"Clark","year":"1981","journal-title":"Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture"},{"key":"10.1016\/0743-1066(86)90014-2_BIB15","article-title":"parlog: A Parallel Logic Programming Language","author":"Clark","year":"1983","journal-title":"Imperial College Research Report 83\u29f85"},{"key":"10.1016\/0743-1066(86)90014-2_BIB16","series-title":"Logic Programming: Functions, Relations and Equations","article-title":"The Unification of Functional and Logic Languages","author":"Darlington","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB17","first-page":"313","article-title":"Logic Programming by Completion","author":"Dershowitz","year":"1984","journal-title":"Proceedings of the 2nd International Logic Programming Conference"},{"key":"10.1016\/0743-1066(86)90014-2_BIB18","series-title":"Proceedings of the 1985 Symposium on Logic Programming","first-page":"54","article-title":"Logic Programming cum Applicative Programming","author":"Dershowitz","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_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","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-1066(86)90014-2_BIB20","series-title":"Logic Programming","first-page":"189","article-title":"Predicate Logic as a Language for Parallel Programming","author":"van","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB21","first-page":"161","article-title":"First Order Unification in an Equational Theory","author":"Fay","year":"1979","journal-title":"Proceedings of the 4th Workshop on Automated Deduction"},{"key":"10.1016\/0743-1066(86)90014-2_BIB22","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/3-540-13345-3_15","article-title":"Oriented Equational Clauses as a Programming Language","author":"Fribourg","year":"1984","journal-title":"Proceedings of the 11th Colloquium on Automata, Languages and Programming"},{"key":"10.1016\/0743-1066(86)90014-2_BIB23","first-page":"259","article-title":"A Narrowing Procedure for Theories with Constructors","author":"Fribourg","year":"1984","journal-title":"Proceedings of the 7th International Conference on Automated Deduction, LNCS 170"},{"key":"10.1016\/0743-1066(86)90014-2_BIB24","series-title":"Proceedings of the 1985 Symposium 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\/0743-1066(86)90014-2_BIB25","first-page":"179","article-title":"An Introduction to obj: A Language for Writing and Testing Formal Algebraic Program Specifications","author":"Goguen","year":"1979","journal-title":"Proceedings of the IEEE Conference on Specifications of Reliable Software"},{"key":"10.1016\/0743-1066(86)90014-2_BIB26","first-page":"115","article-title":"Equality, Types, Modules and Generics for Logic Programming","author":"Goguen","year":"1984","journal-title":"Proceedings of the 2nd International Logic Programming Conference"},{"key":"10.1016\/0743-1066(86)90014-2_BIB27","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 Programm."},{"key":"10.1016\/0743-1066(86)90014-2_BIB28","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-09724-4","author":"Gordon","year":"1979","journal-title":"Edinburgh LCF. LNCS 78"},{"key":"10.1016\/0743-1066(86)90014-2_BIB29","series-title":"Logic Programming","first-page":"267","article-title":"Properties of a Logic Programming Language","author":"Hansson","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB30","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/357153.357158","article-title":"Programming with Equations","volume":"4","author":"Hoffmann","year":"1982","journal-title":"Trans. Programm. Languages and Systems"},{"key":"10.1016\/0743-1066(86)90014-2_BIB31","article-title":"Rewrite Methods for Clausal and Non-clausal Theorem Proving","author":"Hsiang","year":"1983","journal-title":"Proceedings of the 10th ICALP"},{"key":"10.1016\/0743-1066(86)90014-2_BIB32","series-title":"Constrained Resolution: A Complete Method for Higher Order Logic","author":"Huet","year":"1972"},{"key":"10.1016\/0743-1066(86)90014-2_BIB33","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"a Unification Algorithm for Typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0743-1066(86)90014-2_BIB34","series-title":"Formal Language Theory: Perspectives and Open Problems","first-page":"349","article-title":"Equations and Rewrite Rules: A Survey","author":"Huet","year":"1980"},{"key":"10.1016\/0743-1066(86)90014-2_BIB35","first-page":"318","article-title":"Canonical Forms and Unification","author":"Hullot","year":"1980","journal-title":"Proceedings of the 5th Conference on Automated Deduction, LNCS 87"},{"key":"10.1016\/0743-1066(86)90014-2_BIB36","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 Programm."},{"key":"10.1016\/0743-1066(86)90014-2_BIB37","article-title":"Uniform: A Language Based Upon Unification Which Unifies Much of Lisp, Prolog and Actl","author":"Kahn","year":"1981","journal-title":"Proceedings of the 7th IJCAI"},{"key":"10.1016\/0743-1066(86)90014-2_BIB38","series-title":"Computational Problems in Abstract Algebra","first-page":"263","article-title":"Simple Word Problems in Universal Algebras","author":"Knuth","year":"1970"},{"key":"10.1016\/0743-1066(86)90014-2_BIB39","series-title":"Logic Programming","first-page":"315","article-title":"qlog\u2014the Programming Environment for Prolog in Lisp","author":"Komorowski","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB40","first-page":"514","article-title":"Equality for prolog","author":"Kornfeld","year":"1983","journal-title":"Proceedings of the 8th IJCAI"},{"key":"10.1016\/0743-1066(86)90014-2_BIB41","first-page":"294","article-title":"Proving Program Properties, Symbolic Evaluation and Logical Procedural Semantics","author":"Levi","year":"1975","journal-title":"Proceedings of MFCS 75, LNCS"},{"key":"10.1016\/0743-1066(86)90014-2_BIB42","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1051\/ita\/1983170100551","article-title":"Top-Down Mathematical Semantics and Symbolic Execution","volume":"17","author":"Levi","year":"1983","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0743-1066(86)90014-2_BIB43","series-title":"Proceedings of the 1985 Symposium on Logic Programming","first-page":"128","article-title":"The Declarative Semantics of Logical Read-Only Variables","author":"Levi","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB44","article-title":"Functional Programming and the Logical Variable","author":"Lindstrom","year":"1985","journal-title":"Proceedings of the 12th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0743-1066(86)90014-2_BIB45","series-title":"Implementations of prolog","first-page":"147","article-title":"Integrating prolog in the poplog Environment","author":"Mellish","year":"1984"},{"key":"10.1016\/0743-1066(86)90014-2_BIB46","first-page":"184","article-title":"A Proposal for Standard ML","author":"Milner","year":"1984","journal-title":"ACM Symposium on lisp and Functional Programming"},{"key":"10.1016\/0743-1066(86)90014-2_BIB47","first-page":"333","article-title":"A New Interpretation of the Resolution Principle","author":"Paul","year":"1984","journal-title":"Proceedings of the 7th International Conference on Automated Deduction, LNCS 170"},{"key":"10.1016\/0743-1066(86)90014-2_BIB48","series-title":"Proceedings of the 1985 Symposium on Logic Programming","first-page":"138","article-title":"Narrowing as the Operational Semantics of Functional Languages","author":"Reddy","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB49","series-title":"Logic Programming: Functions, Relations and Equations","article-title":"On the Relationship between Logic and Functional Languages","author":"Reddy","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB50","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-15976-2_7","article-title":"narrower: A New Algorithm for Unification and Its Application to Logic Programming","author":"Rety","year":"1985","journal-title":"Proceedings of the First International Conference on Rewriting Techniques and Applications"},{"key":"10.1016\/0743-1066(86)90014-2_BIB51","series-title":"Logic Programming","first-page":"299","article-title":"loglisp: Motivations, Design and Implementation","author":"Robinson","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB52","series-title":"Machine Intelligence 10","article-title":"loglisp: An Alternative to prolog","author":"Robinson","year":"1982"},{"key":"10.1016\/0743-1066(86)90014-2_BIB53","first-page":"157","article-title":"Qute: A Functional Language Based on Unification","author":"Sato","year":"1984","journal-title":"Proceedings of FGCS'84"},{"key":"10.1016\/0743-1066(86)90014-2_BIB54","series-title":"Techn. Rep. TR-003","article-title":"A Subset of Concurrent Prolog and Its Interpreter","author":"Shapiro","year":"1983"},{"key":"10.1016\/0743-1066(86)90014-2_BIB55","series-title":"Proceedings of the 1985 Symposium on Logic Programming","first-page":"254","article-title":"An(other) Integration of Logic and Functional Programming","author":"Srivastava","year":"1985"},{"key":"10.1016\/0743-1066(86)90014-2_BIB56","series-title":"Proceedings of the 1984 International Symposium on Logic Programming","first-page":"144","article-title":"funlog = Functions + Logic: A Computational Model Integrating Functional and Logic Programming","author":"Subrahmanyam","year":"1984"},{"key":"10.1016\/0743-1066(86)90014-2_BIB57","series-title":"sasl Language Manual","author":"Turner","year":"1979"},{"key":"10.1016\/0743-1066(86)90014-2_BIB58","article-title":"Guarded Horn Clauses","author":"Ueda","year":"1985","journal-title":"ICOT Tech. Report TR-103"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106686900142?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743106686900142?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:54:29Z","timestamp":1555127669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743106686900142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["0743106686900142"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(86)90014-2","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}