{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T10:28:12Z","timestamp":1714645692014},"reference-count":9,"publisher":"Elsevier","isbn-type":[{"value":"9780124500105","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/b978-0-12-450010-5.50027-x","type":"book-chapter","created":{"date-parts":[[2012,12,3]],"date-time":"2012-12-03T06:21:37Z","timestamp":1354515697000},"page":"381-391","source":"Crossref","is-referenced-by-count":2,"title":["An Abstraction Mechanism for Symbolic Expressions"],"prefix":"10.1016","author":[{"given":"Masahiko","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib1","series-title":"The Lambda Calculus, Its Syntax and Semantics","author":"Barendregt","year":"1981"},{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib2","series-title":"Theory of Sets","author":"Bourbaki","year":"1968"},{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib3","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\/B978-0-12-450010-5.50027-X_bib4","volume":"I","author":"Curry","year":"1958"},{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib5","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","article-title":"Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I","volume":"3","author":"McCarthy","year":"1960","journal-title":"Comm. ACM"},{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib6","series-title":"Mathematical Logic","author":"Quine","year":"1955"},{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib7","unstructured":"Sato, M., and Hagiya, M., Hyperlisp, in Algorithmic Languages (eds., de Bakker, J.W., and van Vliet, J.C.), North-Holland, Amsterdam, pp. 251\u2013269."},{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0304-3975(83)90137-8","article-title":"Theory of Symbolic Expressions, I","volume":"22","author":"Sato","year":"1983","journal-title":"Theoretical Comp. Sci."},{"key":"10.1016\/B978-0-12-450010-5.50027-X_bib9","unstructured":"Sato, M., and Kameyama, Y., 1990: Constructive Programming in SST, in Proceedings of the Japanese-Czechoslovak Seminar on Theoretical Foundations of Knowledge Information Processing, Inorga, Prague, pp. 23\u201333"}],"container-title":["Artificial and Mathematical Theory of Computation"],"original-title":[],"language":"en","deposited":{"date-parts":[[2018,10,20]],"date-time":"2018-10-20T22:00:17Z","timestamp":1540072817000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B978012450010550027X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9780124500105"],"references-count":9,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-450010-5.50027-x","relation":{},"subject":[],"published":{"date-parts":[[1991]]}}}