{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:32:39Z","timestamp":1649143959718},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1997,11]]},"abstract":"<jats:p>A combinatory system (or equivalently the set of its \n\nbasic combinators) is called combinatorially complete for a \n\nfunctional system, if any member of the latter can be defined \n\nby an entity of the former system. In this paper the \n\ndecision problem of combinatory completeness for \n\nfinite sets of proper combinators is studied for three \n\nsubsystems of the pure lambda calculus. \n\nPrecise characterizations of proper combinator bases for \n\nthe linear and the affine \u03bb-calculus \n\nare given, and the respective decision problems are shown \n\nto be decidable. Furthermore, it is \n\ndetermined which extensions with proper combinators of bases \n\nfor the linear \u03bb-calculus are \n\ncombinatorially complete for the \u03bb<jats:italic>I<\/jats:italic>-calculus.<\/jats:p>","DOI":"10.1017\/s0956796897002888","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:26:15Z","timestamp":1027776375000},"page":"593-612","source":"Crossref","is-referenced-by-count":1,"title":["On combinatory complete sets \n\nof proper combinators"],"prefix":"10.1017","volume":"7","author":[{"given":"SABINE","family":"BRODA","sequence":"first","affiliation":[]},{"given":"LU\u00cdS","family":"DAMAS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1997,11,1]]},"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796897002888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T19:56:11Z","timestamp":1557604571000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796897002888\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0956796897002888"],"URL":"https:\/\/doi.org\/10.1017\/s0956796897002888","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}