{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:40:05Z","timestamp":1742593205622,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540525905"},{"type":"electronic","value":"9783540470427"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52590-4_39","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:38:32Z","timestamp":1330205912000},"page":"42-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatory forms for equational programming: Instances, unification and narrowing"],"prefix":"10.1007","author":[{"given":"M.","family":"Bellia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Bugliesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. E.","family":"Occhiuto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0743-1066(86)90014-2","volume":"3","author":"M. Bellia","year":"1986","unstructured":"M. Bellia and G. Levi 1986 \u201cThe Relation between Logic and Functional Programming Languages: A Survey\u201d, J. Logic Programming,3,3, pages 217\u2013236","journal-title":"J. Logic Programming"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellia \u201cRetactions: a Functional Paradigm for Logic Programming\u201d, TAPSOFT87, LNCS 250, Springer Verlag, pages 260\u2013275.","DOI":"10.1007\/BFb0014985"},{"issue":"4","key":"3_CR3","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1051\/ita\/1988220403951","volume":"22","author":"M. Bellia","year":"1988","unstructured":"M. Bellia 1988 \u201cLogic and Functional Programming by Retractions: Operational Semantics\u201d Informatique Teorique et Applications, 22, 4, pages 395\u2013436.","journal-title":"Informatique Teorique et Applications"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0743-1066(88)90012-X","volume":"5","author":"J. Beer","year":"1988","unstructured":"J. Beer 1988 \u201cThe Occur-check Problem Revised\u201d J. Logic Programming, 5, 3, pp. 243\u2013262.","journal-title":"J. Logic Programming"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"P.G. Bosco, E. Giovannetti and C. Moiso \u201cRefined Strategies for Semantic Unification\u201d TAPSOFT87, LNCS 250, Springer Verlag, pages 276\u2013290.","DOI":"10.1007\/BFb0014986"},{"key":"3_CR6","unstructured":"A. Colmerauer \u201cProlog and Infinite Trees\u201d Logic Programming, K.L. Clark and S-A. Tarnlund eds., Academic Press, pages 231\u2013251."},{"key":"3_CR7","unstructured":"N. Dershowitz and D.A. Plaisted \u201cEquational Programming\u201d Machine Intelligence, 11, pages 21\u201356."},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0743-1066(84)90001-3","volume":"1","author":"M.H. Emden van","year":"1984","unstructured":"M.H. van Emden and J.W. Lloyd 1984 \u201cA Logical Reconstruction of PrologII\u201d, J. Logic Programming,1,2, pages 143\u2013149","journal-title":"J. Logic Programming"},{"key":"3_CR9","unstructured":"M.J. Fay \u201cFirst Order Unification in an Equational Theory\u201d 4th Workshop on Automated Deduction, Austin, Texas, pages 161\u2013167."},{"key":"3_CR10","unstructured":"D.P. Friedman and D.S. Wise \u201cCons Should not Evaluate its Arguments\u201d Automata, Languages and Programming, Michaelson and Milner ed., Edinburgh Univ. Press, pages 257\u2013284."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"G. Huet and D.C. Oppen \u201cEquations and Rewrite Rules: A Survey\u201d Formal Language Theory: Perspectives and Open Problems, R. Book ed., Academic Press, pages 349\u2013405.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"R.J.M. Hughes \u201cSuper-Combinators: A New Implementation Method for Applicative Languages\u201d ACM Symp. on LISP and Functional Programming, pages 1\u201320.","DOI":"10.1145\/800068.802129"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"J.M. Hullot \u201cCanonical Forms and Unification\u201d 5th Conf. on Automated Deduction, LNCS 87, Springer Verlag, pages 318\u2013334.","DOI":"10.1007\/3-540-10009-1_25"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0743-1066(89)90030-7","volume":"6","author":"A. Josephson","year":"1989","unstructured":"A. Josephson and N. Dershowitz 1989 \u201cAn Implementation of Narrowing\u201d J. Logic Programming, 6, 3, pages 57\u201377.","journal-title":"J. Logic Programming"},{"key":"3_CR15","unstructured":"D. Lankford \u201cCanonical Inference\u201d Univ. of Texas, Math. Dept., Automatic Theorem Proving Project, Austin, Texas, Rep. ATp-32."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"G. Lindstrom \u201cFunctional Programming and the Logical Variable\u201d 12th ACM Symp. on Principles of Programming Languages, pages 266\u2013280.","DOI":"10.1145\/318593.318657"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"J-L. Lassez, M.J. Maher and K. Marriott \u201cUnification Revised\u201d Foundations of Deductive Databases and Logic Programming, J. Minker ed., Morgan Kaufmann Pub., pages 587\u2013626.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"key":"3_CR18","volume-title":"Categorical Multi-combinators","author":"R.D. Lins","year":"1986","unstructured":"R.D. Lins 1986 \u201cCategorical Multi-combinators\u201d Univ. of Kent, Computing Lab., Canterbury, U.K."},{"key":"3_CR19","unstructured":"A. Martelli, C. Moiso and G.F. Rossi \u201cAn Algorithm for Unification in Equational Theories\u201d 1986 Symp. on Logic Programming, Seattle, IEEE Comp. Soc. Press, pages 180\u2013186."},{"key":"3_CR20","unstructured":"J.H. Morris, E. Schmidt and P. Wandler \u201cExperience with an Applicative String Processing Language\u201d"},{"key":"3_CR21","unstructured":"D.A. Plaisted \u201cThe Occur-check Problem in Prolog\u201d 1984 Symp. on Logic Programming, Atlantic City, IEEE Comp. Soc. Press, pages 272\u2013280."},{"key":"3_CR22","unstructured":"U.S. Reddy \u201cNarrowing as the Operational Semantics of Functional Languages\u201d 1985 Symp. on Logic Programming, Boston, IEEE Comp. Soc. Press, pages 138\u2013151."},{"key":"3_CR23","first-page":"3","volume-title":"Logic Programming","author":"U.S. Reddy","year":"1986","unstructured":"U.S. Reddy 1986 \u201cOn the Relationship between Logic and Functional Languages\u201d Logic Programming, R. De Groot and G. Lindstrom eds., Prentice-Hall, Englewood Cliffs, N.J., pages 3\u201323."},{"key":"3_CR24","unstructured":"J.A. Robinson \u201cBeyond LogLisp: Combining Functional and Relational Programming in a Reduction Settiing\u201d Machine Intelligence, 11, pages 57\u201368."},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"D.A. Turner 1979 \u201cA New Implementation Technique for Applicative Languages\u201d Software, Practice and Experience, 9, pages 31\u201349.","journal-title":"Software, Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","CAAP '90"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52590-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:02:33Z","timestamp":1742590953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52590-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525905","9783540470427"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-52590-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}