{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:26Z","timestamp":1725663026344},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540183174"},{"type":"electronic","value":"9783540478799"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:33:00Z","timestamp":1330198380000},"page":"60-79","source":"Crossref","is-referenced-by-count":10,"title":["Categorical multi-combinators"],"prefix":"10.1007","author":[{"given":"Rafael","family":"D.Lins","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"5_CR1","unstructured":"H.P.Barendregt, The Lambda Calculus Its Syntax and Semantics, North Holland (1984)."},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N. G. DeBruijn","year":"1972","unstructured":"N.G. DeBruijn, Lambda Calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, Indag.Math. 34, 381\u2013392 (1972).","journal-title":"Indag.Math."},{"key":"5_CR3","unstructured":"G.Cousineau, P-L.Curien, & M.Mauny, The Categorical Abstract Machine, Functional Programming Languages and Computer Architecture, ed. J-P.Jouannaud, SLNCS 201."},{"key":"5_CR4","unstructured":"P-L.Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman Publishing Ltd., (1986)."},{"key":"5_CR5","unstructured":"R.J.M.Hughes, The Design and Implementation of Programming Languages, Ph.D. Thesis, Oxford Univ. Comp.Lab., July 1983."},{"key":"5_CR6","unstructured":"J.Lambek, From Lambda-calculus to Cartesian Closed Categories, in To H.B.Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, ed J.P.Seldin and J.R.Hindley, Academic Press (1980)."},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"P.J.Landin, The Mechanical Evaluation of Expressions, Comput.J.6, (1963\u20134)","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"5_CR8","unstructured":"S.J.Leviseur & R.D.Lins, On The Efficiency of Categorical Combinators & Multi-Combinators, in preparation."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"R.D.Lins, A New Formula for The Execution of Categorical Combinators, Proceedings of 8th. International Conference on Automated Deduction, Oxford, England, July 1986, LNCS 230, p 89\u201398, Springer Verlag.","DOI":"10.1007\/3-540-16780-3_82"},{"key":"5_CR10","unstructured":"R.D.Lins, On the Efficiency of Categorical Combinators in Applicative Languages, Ph.D. Thesis, The University of Kent at Canterbury, October 1986."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"R.D.Lins, On the Efficiency of Categorical Combinators as a Rewriting system, to appear in Software Practice & Experience, (1987).","DOI":"10.1002\/spe.4380170807"},{"key":"5_CR12","unstructured":"R.D.Lins, Implementing SASL using Categorical Multi-Combinators, in preparation."},{"key":"5_CR13","unstructured":"D.Scott, Relating Theories of the Lambda-Calculus, in To H.B.Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, ed. J.P.Seldin and J.R.Hindley, Academic Press (1980)."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"D.A. Turner, A New Implementation Technique for Applicative Languages, Software Practice and Experience, Vol 9, 31\u201349 (1979).","journal-title":"Software Practice and Experience"},{"key":"5_CR15","unstructured":"C.P.Wadsworth, Semantics and Pragmatics of the Lambda Calculus, Oxford Univ. D.Phil. Thesis, 1971."}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:41Z","timestamp":1605644081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-18317-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}