{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:30:50Z","timestamp":1672428650090},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1995,12]]},"abstract":"<jats:p> We develop a theory for constructing Combinatory Versions of \u03bb-calculi. Our theory is based on a method, used by Quine and Bernays, for the general elimination of variables in formulations of first-order logic. Our Combinatory Calculus presents a significant departure from those propounded by Sch\u00f6nfinkel and Curry. A non-trivial extension of Quine\u2019s technique is developed, to go beyond the realm of first-order quantification theory, and cover the entire \u03bb-calculus. The system consists of five Combinators, powerful enough to represent \u03bb-abstractions over arbitrary terms. The Combinatory Calculus is shown to have the property of functional completeness. Algorithmic translations from the \u03bb-calculus to the Combinatory Version, and vice-versa, are provided. The approach has the distinct advantage of being able to encode combinatory formulations of process algebras. <\/jats:p>","DOI":"10.1142\/s0129054195000226","type":"journal-article","created":{"date-parts":[[2004,11,12]],"date-time":"2004-11-12T11:59:25Z","timestamp":1100260765000},"page":"417-430","source":"Crossref","is-referenced-by-count":2,"title":["THE QUINE-BERNAYS COMBINATORY CALCULUS"],"prefix":"10.1142","volume":"06","author":[{"given":"N.","family":"RAJA","sequence":"first","affiliation":[{"name":"Computer Science Group, Tata Institute of Fundamental Research, Bombay 400 005, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.K.","family":"SHYAMASUNDAR","sequence":"additional","affiliation":[{"name":"Computer Science Group, Tata Institute of Fundamental Research, Bombay 400 005, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054195000226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:31:07Z","timestamp":1565191867000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054195000226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":0,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1995,12]]}},"alternative-id":["10.1142\/S0129054195000226"],"URL":"https:\/\/doi.org\/10.1142\/s0129054195000226","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}