{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:02Z","timestamp":1725663062526},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184201"},{"type":"electronic","value":"9783540479635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18420-1_69","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:35:01Z","timestamp":1330198501000},"page":"426-450","source":"Crossref","is-referenced-by-count":1,"title":["Unification of quantified terms"],"prefix":"10.1007","author":[{"given":"John","family":"Staples","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"75","author":"N.G. Bruijn de","year":"1972","unstructured":"dE BRUIJN, N.G., Lambda calculus notation with nameless dummies. Nederl. Akad. Wetensch. Series A 75 (1972) 381\u2013392.","journal-title":"Nederl. Akad. Wetensch."},{"key":"23_CR2","unstructured":"LLOYD, J.W. AND TOPOR, R., Making Prolog more expressive. Univ. Melb. Dept Comp. Sci. Tech. Report 84\/8 (1984)."},{"key":"23_CR3","volume-title":"Equational logic as a programming language","author":"M.J. O'Donnell","year":"1985","unstructured":"O'DONNELL, M.J., Equational logic as a programming language. M.I.T. Press, Cambridge, Mass., 1985."},{"key":"23_CR4","first-page":"201","volume":"3","author":"J. Staples","year":"1981","unstructured":"STAPLES, JOHN, A new technique for analysing parameter passing, applied to the lambda calculus. Austral. Comp. Sci. Commun. 3 (1981) 201\u2013210.","journal-title":"Austral. Comp. Sci. Commun."}],"container-title":["Lecture Notes in Computer Science","Graph Reduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18420-1_69.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:15:13Z","timestamp":1619558113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_69","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}