{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:47:21Z","timestamp":1749124041172},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0167-6423(85)90009-7","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"143-169","source":"Crossref","is-referenced-by-count":31,"special_numbering":"C","title":["Verifying the unification algorithm in LCF"],"prefix":"10.1016","volume":"5","author":[{"given":"Lawrence C.","family":"Paulson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(85)90009-7_BIB1","series-title":"Algorithm development in Martin-L\u00f6f's type theory","author":"Backhouse","year":"1984"},{"key":"10.1016\/0167-6423(85)90009-7_BIB2","series-title":"A Computational Logic","author":"Boyer","year":"1979"},{"key":"10.1016\/0167-6423(85)90009-7_BIB3","series-title":"Report ICSCA-CMP-37","article-title":"A mechanical proof of the Turing completeness of pure LISP","author":"Boyer","year":"1983"},{"key":"10.1016\/0167-6423(85)90009-7_BIB4","series-title":"Recursive Programming Techniques","author":"Burge","year":"1975"},{"key":"10.1016\/0167-6423(85)90009-7_BIB5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/12.1.41","article-title":"Proving properties of programs by structural induction","volume":"12","author":"Burstall","year":"1969","journal-title":"Comput. J."},{"key":"10.1016\/0167-6423(85)90009-7_BIB6","series-title":"Report CSR-62\u201380","article-title":"HOPE: an experimental applicative language","author":"Burstall","year":"1981"},{"key":"10.1016\/0167-6423(85)90009-7_BIB7","series-title":"Artificial Intelligence Programming","author":"Charniak","year":"1980"},{"key":"10.1016\/0167-6423(85)90009-7_BIB8","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/0167-6423(85)90009-7_BIB9","series-title":"Report CSR-113-82","article-title":"On using Edinburgh LCF to prove the correctness of a parsing algorithm","author":"Cohn","year":"1982"},{"key":"10.1016\/0167-6423(85)90009-7_BIB10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1137\/0212016","article-title":"The equivalence of two semantic definitions: a case study in LCF","volume":"12","author":"Cohn","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(85)90009-7_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0743-1066(84)90020-7","article-title":"Synthesis of a unification algorithm in a logic programming calculus","volume":"1","author":"Eriksson","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0167-6423(85)90009-7_BIB12","series-title":"Edinburgh LCF","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(85)90009-7_BIB13","series-title":"Tools and Notions for Program Construction","first-page":"163","article-title":"Representing a logic in the LCF metalanguage","author":"Gordon","year":"1982"},{"key":"10.1016\/0167-6423(85)90009-7_BIB14","series-title":"Report 42","article-title":"Proving a computer correct with the LCF_LSM hardware verification system","author":"Gordon","year":"1983"},{"key":"10.1016\/0167-6423(85)90009-7_BIB15","series-title":"Higher Order Logic: description of the HOL proof generating system","author":"Gordon","year":"1984"},{"key":"10.1016\/0167-6423(85)90009-7_BIB16","article-title":"Checking Landau's \u2018Grundlagen\u2019 in the AUTOMATH systems","author":"van Benthem Jutting","year":"1977"},{"key":"10.1016\/0167-6423(85)90009-7_BIB17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0167-6423(81)90004-6","article-title":"Deductive synthesis of the unification algorithm","volume":"1","author":"Manna","year":"1981","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(85)90009-7_BIB18","series-title":"Logic, Methodology, and Science VI","first-page":"153","article-title":"Constructive mathematics and computer programming","author":"Martin-L\u00f6f","year":"1979"},{"key":"10.1016\/0167-6423(85)90009-7_BIB19","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(85)90009-7_BIB20","series-title":"Seventh Conference on Automated Deduction","first-page":"460","article-title":"The mechanization of existence proofs of recursive predicates","author":"Mulmuley","year":"1984"},{"key":"10.1016\/0167-6423(85)90009-7_BIB21","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6423(83)90008-4","article-title":"A higher-order implementation of rewriting","volume":"3","author":"Paulson","year":"1983","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(85)90009-7_BIB22","article-title":"The revised logic PPLAMBDA: a reference manual","author":"Paulson","year":"1983"},{"key":"10.1016\/0167-6423(85)90009-7_BIB23","article-title":"Tactics and tacticals in Cambridge LCF","author":"Paulson","year":"1983"},{"key":"10.1016\/0167-6423(85)90009-7_BIB24","series-title":"International Symposium on Semantics of Data Types","first-page":"197","article-title":"Deriving structural induction in LCF","author":"Paulson","year":"1984"},{"key":"10.1016\/0167-6423(85)90009-7_BIB25","doi-asserted-by":"crossref","DOI":"10.1016\/S0747-7171(86)80002-5","article-title":"Constructing recursion operators in Intuitionistic Type Theory","author":"Paulson","year":"1984"},{"key":"10.1016\/0167-6423(85)90009-7_BIB26","article-title":"An LCF proof of the soundness of Hoare's logic","author":"Soko\u0142owski","year":"1983"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900097?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642385900097?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:50:00Z","timestamp":1553442600000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642385900097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":26,"alternative-id":["0167642385900097"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(85)90009-7","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}