{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:45:14Z","timestamp":1764305114560},"reference-count":4,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":12703,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1979,6]]},"abstract":"<jats:p>This short article presents an algorithm for bracket abstraction [1] which avoids a combinatorial explosion in the size of the resulting expression when applied repeatedly for abstraction in a series of variables. It differs from a previous solution [2] in introducing only a finite number of additional combinators and in not requiring that all the variables to be abstracted be treated together in a single operation.<\/jats:p>","DOI":"10.2307\/2273733","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T21:50:09Z","timestamp":1146952209000},"page":"267-270","source":"Crossref","is-referenced-by-count":77,"title":["Another algorithm for bracket abstraction"],"prefix":"10.1017","volume":"44","author":[{"given":"D. A.","family":"Turner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200048970_ref004","unstructured":"Turner D. A. , SASL language manual, St. Andrews University, Fife, Scotland, 1976."},{"key":"S0022481200048970_ref003","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448013"},{"key":"S0022481200048970_ref002","first-page":"222","volume":"41","author":"Abdali","year":"1976","journal-title":"An abstraction algorithm for combinatory logic"},{"key":"S0022481200048970_ref001","volume-title":"Combinatory logic","volume":"1","author":"Curry","year":"1958"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200048970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:20:40Z","timestamp":1558905640000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200048970\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,6]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,6]]}},"alternative-id":["S0022481200048970"],"URL":"https:\/\/doi.org\/10.2307\/2273733","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,6]]}}}