{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:12Z","timestamp":1725663312828},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540171843"},{"type":"electronic","value":"9783540472537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-17184-3_41","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:08:36Z","timestamp":1330196916000},"page":"85-103","source":"Crossref","is-referenced-by-count":2,"title":["Combinateurs Cat\u00e9goriques et Impl\u00e9mentation des Langages Fonctionnels"],"prefix":"10.1007","author":[{"given":"Guy","family":"Cousineau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Louis","family":"Curien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Mauny","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asc\u00e1nder","family":"Su\u00e1rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N.G. Bruijn De","year":"1972","unstructured":"N.G. De Bruijn, Lambda-calculus Notation with Nameless Dummies, a Tool for Automatic Formula Manipulation, Indag Math. 34, 381\u2013392 (1972).","journal-title":"Indag Math."},{"key":"5_CR2","first-page":"3","volume":"I","author":"L. Cardelli","year":"1983","unstructured":"L. Cardelli, ML under Unix, Polymorphism, Vol. I,3 (Dec. 1983).","journal-title":"Polymorphism"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"L. Cardelli, Compiling a Functional Language, Proc. ACM Conf. on Lisp and Functional Programming, Austin (1984).","DOI":"10.1145\/800055.802037"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"G. Cousineau, P-L. Curien, M. Mauny, The Categorical Abstract Machine, Symposium on Functional Programming Languages and Computer Architecture, Nancy sept. 85, Lect. Notes in Comput. Sci. 201 (1985) (version longue \u00e0 para\u00eetre dans Science of Computer Programming).","DOI":"10.1007\/3-540-15975-4_29"},{"key":"5_CR5","unstructured":"G. Cousineau, P-L. Curien, M. Mauny, The Categorical Abstract Machine (version longue). A para\u00eetre dans Sci. of Comput. Prog."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"P-L. Curien, Categorical Combinatory Logic, ICALP 85, Nafplion, Lect. Notes in Comput. Sci. 194 (1985).","DOI":"10.1007\/3-540-15198-2_10"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"P-L. Curien, Typed Categorical Combinatory Logic, CAAP 85, Berlin, Lect. Notes in Comput. Sci. 185 (1985).","DOI":"10.1007\/3-540-15198-2_10"},{"key":"5_CR8","unstructured":"P-L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman (1986)."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"M. Gordon, R. Milner, C. Wadsworth, Edinburgh LCF, Lect. Notes in Comput. Sci. 78, (1979).","DOI":"10.1007\/3-540-09724-4"},{"key":"5_CR10","unstructured":"The ML Handbook, Inria technical report, (dec 84)."},{"key":"5_CR11","unstructured":"P. Henderson, Functional Programming: Application and Implementation, Prentice Hall International (1980)."},{"key":"5_CR12","unstructured":"R. Hindley, Combinators and Lambda-calculus, a Short Outline, dans ce volume."},{"key":"5_CR13","unstructured":"G. Huet, Cartesian Closed Categories and Lambda-calculus, dans ce volume."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"R.J.M. Hughes, Super Combinators: A New Implementation Method for Applicative Languages, Proceedings of the 1982 ACM Symposium on Lisp and Functional Programming, Pittsburgh (1982).","DOI":"10.1145\/800068.802129"},{"key":"5_CR15","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"P.J. Landin, The Mechanical Evaluation of Expressions, Computer Journal 6, 308\u2013320 (1964).","journal-title":"Computer Journal"},{"key":"5_CR16","unstructured":"M. Mauny, Compilation des langages fonctionnels dans les Combinateurs Cat\u00e9goriques, Th\u00e8se de Troisi\u00e8me Cycle de l'Universit\u00e9 Paris VII (sept 1985)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"M. Mauny, A. Su\u00e1rez, Implementing Functional Languages in the Categorical Abstract Machine, \u00e0 para\u00eetre dans Proc. ACM Conf. on Lisp and Functional Programming (1986)","DOI":"10.1145\/319838.319869"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"R. Milner, A proposal for Standard ML, Proc. ACM Conf. on Lisp and Functional Programming, Austin (1984).","DOI":"10.1145\/800055.802035"},{"key":"5_CR19","unstructured":"S. Peyton-Jones, An Introduction to Fully-lazy Super Combinators, dans ce volume."},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"G.D. Plotkin, Call-by-name, Call-by-value and the \u03bb-calculus, Theoret. Comput. Sci. 1, 125\u2013159 (1975).","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR21","unstructured":"A. Su\u00e1rez, Th\u00e8se en pr\u00e9paration."},{"key":"5_CR22","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"}],"container-title":["Lecture Notes in Computer Science","Combinators and Functional Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17184-3_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:12:28Z","timestamp":1605643948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17184-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540171843","9783540472537"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-17184-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}