{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:19Z","timestamp":1761611179574},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":6036,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[1997,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Translations from Lambda calculi into combinatory logics can be used to avoid some implementational problems of the former systems. However, this scheme can only be efficient if the translation produces short output with a small number of combinators, in order to reduce the time and transient storage space spent during reduction of combinatory terms. In this paper we present a combinatory system and an abstraction algorithm, based on the original bracket abstraction operator of Sch\u00f6nfinkel [9]. The algorithm introduces at most one combinator for each abstraction in the initial Lambda term. This avoids explosive term growth during successive abstractions and makes the system suitable for practical applications. We prove the correctness of the algorithm and establish some relations between the combinatory system and the Lambda calculus.<\/jats:p>","DOI":"10.2307\/2275570","type":"journal-article","created":{"date-parts":[[2006,5,6]],"date-time":"2006-05-06T19:01:58Z","timestamp":1146942118000},"page":"729-740","source":"Crossref","is-referenced-by-count":5,"title":["Compact bracket abstraction in combinatory logic"],"prefix":"10.1017","volume":"62","author":[{"given":"Sabine","family":"Broda","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Damas","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200016005_ref009","doi-asserted-by":"publisher","DOI":"10.1007\/BF01448013"},{"key":"S0022481200016005_ref001","first-page":"222","volume":"41","author":"Abdali","year":"1976","journal-title":"An abstraction algorithm for combinatory logic"},{"key":"S0022481200016005_ref010","first-page":"378","volume-title":"Proceedings of the LICS '86","author":"Statman","year":"1986"},{"key":"S0022481200016005_ref007","volume-title":"Complexity of combinatory code","author":"Mulder","year":"1985"},{"key":"S0022481200016005_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90100-X"},{"key":"S0022481200016005_ref006","volume-title":"Counting director strings","author":"Kennaway","year":"1984"},{"key":"S0022481200016005_ref008","volume-title":"The implementation offunctional programming languages","author":"Jones","year":"1987"},{"key":"S0022481200016005_ref003","first-page":"322","volume-title":"Handbook of Theoretical Computer Science","author":"Barendregt","year":"1990"},{"key":"S0022481200016005_ref002","volume-title":"The Lambda calculus, its syntax and semantics","author":"Barendregt","year":"1981"},{"key":"S0022481200016005_ref004","volume-title":"Combinatory logic","volume":"1","author":"Curry","year":"1958"},{"key":"S0022481200016005_ref012","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380090105"},{"key":"S0022481200016005_ref011","first-page":"267","volume":"44","author":"Turner","year":"1979","journal-title":"Another algorithm for bracket abstraction"}],"container-title":["Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200016005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T16:24:47Z","timestamp":1557591887000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200016005\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0022481200016005"],"URL":"https:\/\/doi.org\/10.2307\/2275570","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}