{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:33Z","timestamp":1761611073275},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"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":[[1983,8]]},"DOI":"10.1016\/0167-6423(83)90008-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:09:22Z","timestamp":1027642162000},"page":"119-149","source":"Crossref","is-referenced-by-count":53,"title":["A higher-order implementation of rewriting"],"prefix":"10.1016","volume":"3","author":[{"given":"Lawrence","family":"Paulson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(83)90008-4_BIB1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neumann style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(83)90008-4_BIB2","series-title":"A Computational Logic","author":"Boyer","year":"1979"},{"key":"10.1016\/0167-6423(83)90008-4_BIB3","series-title":"Polymorphism: the ML\/LCF\/HOPE Newsletter","article-title":"The functional abstract machine","author":"Cardelli","year":"1983"},{"key":"10.1016\/0167-6423(83)90008-4_BIB4","series-title":"Artificial Intelligence Programming","author":"Charniak","year":"1980"},{"key":"10.1016\/0167-6423(83)90008-4_BIB5","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/0167-6423(83)90008-4_BIB6","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(83)90008-4_BIB7","series-title":"Edinburgh LCF","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(83)90008-4_BIB8","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(83)90008-4_BIB9","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\/0167-6423(83)90008-4_BIB10","series-title":"Report No. 17\/82","article-title":"An implementation and investigation of the Knuth-Bendix completion procedure","author":"Kuechlin","year":"1982"},{"key":"10.1016\/0167-6423(83)90008-4_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(77)90056-1","article-title":"Algebraic structures for transitive closure","volume":"4","author":"Lehmann","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(83)90008-4_BIB12","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0167-6423(83)90008-4_BIB13","series-title":"Report No. 34","article-title":"Recent developments in LCF: examples of structural induction","author":"Paulson","year":"1983"},{"key":"10.1016\/0167-6423(83)90008-4_BIB14","series-title":"Report No. 36","article-title":"The revised logic PPLAMBDA: a reference manual","author":"Paulson","year":"1983"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900084?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642383900084?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:50:09Z","timestamp":1555077009000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642383900084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0167642383900084"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(83)90008-4","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}