{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:19Z","timestamp":1742600419694,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604280"},{"type":"electronic","value":"9783540455950"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60428-6_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:27:38Z","timestamp":1330280858000},"page":"359-370","source":"Crossref","is-referenced-by-count":0,"title":["A new translation algorithm from lambda calculus into combinatory logic"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Broda","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Damas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1017\/S0022481200051914","volume":"41","author":"S. Abdali","year":"1976","unstructured":"S. Abdali. An abstraction algorithm for combinatory logic. Journal of Symbolic Logic, 41:222\u2013224, 1976.","journal-title":"Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"H. Barendregt. Functional programming and lambda calculus. Handbook of Theoretical Computer Science, pages 322\u201363, 1990.","key":"30_CR2","DOI":"10.1016\/B978-0-444-88074-1.50012-3"},{"doi-asserted-by":"crossref","unstructured":"L. Cardelli. Semantics of multiple inheritance. In Kahn, MacQueen, and Plotkin, editors, Semantics of Data Types, volume 173 of LNCS. Springer Verlag, 1984.","key":"30_CR3","DOI":"10.1007\/3-540-13346-1_2"},{"key":"30_CR4","volume-title":"Combinatory Logic Vol. 1.","author":"H. Curry","year":"1958","unstructured":"H. Curry and R. Feys. Combinatory Logic Vol. 1. North-Holland, Amsterdam, 1958."},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00630923","volume":"14","author":"M. Dalrymple","year":"1991","unstructured":"M. Dalrymple, S. M. Shieber, and F. C. N. Pereira. Ellipsis and higher-order unification. Linguistics and Philosophy, 14:399\u2013452, 1991.","journal-title":"Linguistics and Philosophy"},{"key":"30_CR6","volume-title":"Introduction to Montague Semantics","author":"D. Dowty","year":"1985","unstructured":"D. Dowty, R. Wall, and S. Peters. Introduction to Montague Semantics. D. Reidel Publishing Company, Dordrecht, 1985."},{"doi-asserted-by":"crossref","unstructured":"J. Hugues. Supercombinators, a new implementation method for applicative languages. Proc. ACM Symp. on Lisp and Functional Programming, pages 1\u201310, 1988.","key":"30_CR7","DOI":"10.1145\/800068.802129"},{"unstructured":"J. P. S. J. Roger Hindley. Introduction to Combinators and \u03bb-Calculus. Cambridge University Press, 1986.","key":"30_CR8"},{"key":"30_CR9","volume-title":"Counting director strings","author":"J. R. Kennaway","year":"1984","unstructured":"J. R. Kennaway and M. R. Sleep. Counting director strings. University of East Anglia, Norwich, 1984."},{"unstructured":"J. Mulder. Complexity of combinatory code. Preprint 389, University Utrecht, Department of Mathematics, August 1985.","key":"30_CR10"},{"unstructured":"F. Pereira. Categorial semantics and scoping. Computational Linguistics, 16(1), 1990.","key":"30_CR11"},{"unstructured":"F. Pereira and S. Shieber. Prolog and natural-language analysis. CSLI Lecture Notes, 10, 1987.","key":"30_CR12"},{"unstructured":"S. Peyton Jones. The implementation of functional programming languages. Prentice-Hall, 1987.","key":"30_CR13"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/BF01448013","volume":"92","author":"M. Sch\u00f6nfinkel","year":"1924","unstructured":"M. Sch\u00f6nfinkel. \u00dcber die Bausteine der mathematischen Logik. Mathematische Annalen, 92:305\u2013316, 1924.","journal-title":"Mathematische Annalen"},{"unstructured":"R. Statman. On translating lambda terms into combinators; the basis problem. pages 378\u2013382. IEEE, 1986. Proceedings of the LICS'86.","key":"30_CR15"},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.2307\/2273733","volume":"44","author":"D. Turner","year":"1979","unstructured":"D. Turner. Another algorithm for bracket abstraction. Journal of Symbolic Logic,44:267\u2013270, 1979.","journal-title":"Journal of Symbolic Logic"},{"key":"30_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. Turner","year":"1979","unstructured":"D. Turner. A new implementation technique for applicative languages. Software-Practice and Experience, 9:31\u201349, 1979.","journal-title":"Software-Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60428-6_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:03:22Z","timestamp":1742598202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60428-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604280","9783540455950"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60428-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}