{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:21:36Z","timestamp":1648851696216},"reference-count":52,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":7502,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1016\/0304-3975(93)90170-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"209-252","source":"Crossref","is-referenced-by-count":5,"title":["C-expressions: a variable-free calculus for equational logic programming"],"prefix":"10.1016","volume":"107","author":[{"given":"Marco","family":"Bellia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.Eugenia","family":"Occhiuto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90170-X_BIB1","first-page":"1","article-title":"Explicit substitutions","author":"Abadi","year":"1990","journal-title":"Proc. POPL '90"},{"key":"10.1016\/0304-3975(93)90170-X_BIB2","unstructured":"H. A\u00eft-Kaci, The WAM: a (real) tutorial, Digital Paris Research Laboratories, Paris, 1990, 5, 1990."},{"key":"10.1016\/0304-3975(93)90170-X_BIB3","series-title":"Is there a meaning to LIFE?","author":"A\u00eft-Kaci","year":"1991"},{"key":"10.1016\/0304-3975(93)90170-X_BIB4","unstructured":"A. Asperti, Combinators for categorial unification, private communication, 1991."},{"key":"10.1016\/0304-3975(93)90170-X_BIB5","first-page":"337","article-title":"Projections instead of variables: a category theoretic interpretation of logic programs","author":"Asperti","year":"1989","journal-title":"Proc. 6th Internat. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB6","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":"1985"},{"issue":"3","key":"10.1016\/0304-3975(93)90170-X_BIB7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0743-1066(88)90012-X","article-title":"The occur-check problem revised","volume":"5","author":"Beer","year":"1988","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB8","first-page":"260","article-title":"Retractions: a functional paradigm for logic programming","volume":"Vol. 250","author":"Bellia","year":"1987"},{"issue":"4","key":"10.1016\/0304-3975(93)90170-X_BIB9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1051\/ita\/1988220403951","article-title":"Logic and functional programming by retractions: operational semantics","volume":"22","author":"Bellia","year":"1988","journal-title":"RAIRO Inform. Theor. Appl."},{"key":"10.1016\/0304-3975(93)90170-X_BIB10","first-page":"42","article-title":"Combinatory forms for equational programming: instances, unification and narrowing","volume":"Vol. 431","author":"Bellia","year":"1990"},{"issue":"3","key":"10.1016\/0304-3975(93)90170-X_BIB11","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","article-title":"The relation between logic and functional programming languages: a survey","volume":"3","author":"Bellia","year":"1986","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB12","article-title":"Operators for unification and most general instance","author":"Bellia","year":"1990","journal-title":"UNIF '90 4th Workshop on Unification"},{"key":"10.1016\/0304-3975(93)90170-X_BIB13","series-title":"Tech. Report TR-19\/90","article-title":"A variable free calculus for equational programming","author":"Bellia","year":"1990"},{"key":"10.1016\/0304-3975(93)90170-X_BIB14","series-title":"Tech. Report TR-29\/90","article-title":"Suprema of open and closed formulas and their application to resolution","author":"Bellia","year":"1990"},{"key":"10.1016\/0304-3975(93)90170-X_BIB15","first-page":"276","article-title":"Refined strategies for semantic unification","volume":"Vol. 250","author":"Bosco","year":"1987"},{"key":"10.1016\/0304-3975(93)90170-X_BIB16","series-title":"Logic Programming","first-page":"231","article-title":"Prolog and infinite trees","author":"Colmerauer","year":"1982"},{"key":"10.1016\/0304-3975(93)90170-X_BIB17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda-calculus notation with nameless dummies: a tool for automatic formula manipulation","volume":"34","author":"De Bruijn","year":"1972","journal-title":"Indag. Math."},{"key":"10.1016\/0304-3975(93)90170-X_BIB18","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","article-title":"Ordering for term-rewriting systems","volume":"17","author":"Dershowitz","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90170-X_BIB19","series-title":"Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics","first-page":"244","article-title":"Rewrite systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(93)90170-X_BIB20","first-page":"21","article-title":"Equational programming","volume":"11","author":"Dershowitz","year":"1987","journal-title":"Mach. Intell."},{"issue":"1","key":"10.1016\/0304-3975(93)90170-X_BIB21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","article-title":"On the sequential nature of unification","volume":"1","author":"Dwork","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB22","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","article-title":"Properties of substitutions and unification","volume":"1","author":"Eder","year":"1985","journal-title":"J. Symbolic Comput."},{"issue":"2","key":"10.1016\/0304-3975(93)90170-X_BIB23","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0743-1066(84)90001-3","article-title":"A logical reconstruction of Prolog II","volume":"1","author":"van Emden","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB24","first-page":"161","article-title":"First order unification in an equational theory","author":"Fay","year":"1979","journal-title":"Proc. 4th Workshop on Automated Deduction"},{"key":"10.1016\/0304-3975(93)90170-X_BIB25","series-title":"Automata, Languages and Programming","first-page":"257","article-title":"Cons should not evaluate its arguments","author":"Friedman","year":"1976"},{"key":"10.1016\/0304-3975(93)90170-X_BIB26","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\/0304-3975(93)90170-X_BIB27","first-page":"1","article-title":"Super-combinators: a new implementation method for applicative languages","author":"Hughes","year":"1982","journal-title":"Proc. ACM Symp. on LISP and Functional Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB28","first-page":"318","article-title":"Canonical forms and unification","volume":"Vol. 87","author":"Hullot","year":"1980"},{"issue":"3","key":"10.1016\/0304-3975(93)90170-X_BIB29","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0743-1066(89)90030-7","article-title":"An implementation of narrowing","volume":"6","author":"Josephson","year":"1989","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB30","series-title":"Unification","year":"1990"},{"key":"10.1016\/0304-3975(93)90170-X_BIB31","first-page":"679","article-title":"Substitution and refutation revisited","author":"Ko","year":"1991","journal-title":"Proc. 8th Internat. Conf. on Logic Programming"},{"key":"10.1016\/0304-3975(93)90170-X_BIB32","first-page":"271","article-title":"Graph-based implementation of a functional logic language","volume":"Vol. 432","author":"Kuchen","year":"1990"},{"key":"10.1016\/0304-3975(93)90170-X_BIB33","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF03037460","article-title":"How to invent a Prolog machine","volume":"5","author":"Kursawe","year":"1987","journal-title":"New Generation Comput."},{"key":"10.1016\/0304-3975(93)90170-X_BIB34","series-title":"Report ATp-32","article-title":"Canonical Inference","author":"Lankford","year":"1975"},{"key":"10.1016\/0304-3975(93)90170-X_BIB35","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"587","article-title":"Unification revised","author":"Lassez","year":"1987"},{"key":"10.1016\/0304-3975(93)90170-X_BIB36","first-page":"266","article-title":"Functional programming and the logical variable","author":"Lindstrom","year":"1985","journal-title":"Proc. 12th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(93)90170-X_BIB37","series-title":"Categorical multi-combinators","author":"Lins","year":"1986"},{"key":"10.1016\/0304-3975(93)90170-X_BIB38","series-title":"Proc. 1986 Symp. on Logic Programming","first-page":"180","article-title":"An algorithm for unification in equational theories","author":"Martelli","year":"1986"},{"issue":"2","key":"10.1016\/0304-3975(93)90170-X_BIB39","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1145\/357162.357169","article-title":"An efficient unification algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/0304-3975(93)90170-X_BIB40","series-title":"Proc. 7th Symp. on Principles of Programming Languages","first-page":"32","article-title":"Experience with an applicative string processing language","author":"Morris","year":"1980"},{"key":"10.1016\/0304-3975(93)90170-X_BIB41","first-page":"386","article-title":"Algebraic properties of idempotent substitutions","volume":"Vol. 443","author":"Palamidessi","year":"1990"},{"key":"10.1016\/0304-3975(93)90170-X_BIB42","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","article-title":"Linear unification","volume":"16","author":"Paterson","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90170-X_BIB43","series-title":"Proc. 1984 Symp. on Logic Programming","first-page":"272","article-title":"The occur-check problem in Prolog","author":"Plaisted","year":"1984"},{"key":"10.1016\/0304-3975(93)90170-X_BIB44","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\/0304-3975(93)90170-X_BIB45","series-title":"Logic Programming","first-page":"3","article-title":"On the relationship between logic and functional languages","author":"Reddy","year":"1986"},{"key":"10.1016\/0304-3975(93)90170-X_BIB46","first-page":"135","article-title":"Transformational system and algebraic structure of atomic formulas","volume":"5","author":"Reynolds","year":"1970","journal-title":"Mach. Intell."},{"key":"10.1016\/0304-3975(93)90170-X_BIB47","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(93)90170-X_BIB48","first-page":"57","article-title":"Beyond LogLisp: combining functional and relational programming in a reduction setting","volume":"11","author":"Robinson","year":"1987","journal-title":"Mach. Intell."},{"key":"10.1016\/0304-3975(93)90170-X_BIB49","series-title":"PROLOG, Manuel de reference et d'utilisation","author":"Roussel","year":"1975"},{"key":"10.1016\/0304-3975(93)90170-X_BIB50","series-title":"J. Logic Programming","article-title":"A verified Prolog compiler for the Warren abstract machine","author":"Russinoff","year":"1991"},{"key":"10.1016\/0304-3975(93)90170-X_BIB51","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","article-title":"A new implementation technique for applicative languages","volume":"9","author":"Turner","year":"1979","journal-title":"Software, Practice and Experience"},{"key":"10.1016\/0304-3975(93)90170-X_BIB52","series-title":"Tech. Report 309","article-title":"An abstract Prolog instruction set","author":"Warren","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390170X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390170X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:21:19Z","timestamp":1555114879000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390170X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["030439759390170X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90170-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}