{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:40:35Z","timestamp":1736106035672,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164883"},{"type":"electronic","value":"9783540398271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/bfb0027041","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:34:05Z","timestamp":1132392845000},"page":"122-207","source":"Crossref","is-referenced-by-count":1,"title":["Functional programming and the language tale"],"prefix":"10.1007","author":[{"given":"Henk","family":"Barendregt","sequence":"first","affiliation":[]},{"given":"Marc","family":"van Leeuwen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"L. Augustsson [1984] A compiler for lazy ML, proc. ACM conf. on LISP and functional programming, 218\u2013227.","DOI":"10.1145\/800055.802038"},{"issue":"4","key":"4_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus [1978] Can programming be liberated from the von Neumann style? Comm. ACM 21(4), 613\u2013641.","journal-title":"Comm. ACM"},{"key":"4_CR3","volume-title":"The lambda calculus, its syntax and semantics","author":"H.P. Barendregt","year":"1984","unstructured":"H.P. Barendregt [1984] The lambda calculus, its syntax and semantics. North Holland, Amsterdam."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Burstall, R.M., D.B. MacQueen and D.T. Sannella [1980] HOPE: an experimental applicative language, in: Proceedings first LISP conference, Stanford, 136\u2013143.","DOI":"10.1145\/800087.802799"},{"key":"4_CR5","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 [1972] Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, Indag. Math. 34, 381\u2013392.","journal-title":"Indag. Math."},{"key":"4_CR6","unstructured":"J.-Y. Girard [1972] Interpr\u00e9tation fonctionelle et \u00e9limination des coupures dans l'arithm\u00e9tique d'ordre sup\u00e9rieur, Ph.D. thesis, Universit\u00e9 de Paris VII."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"T. Johnsson [1984] Efficient compilation of lazy evaluation, proc. of 1984 ACM SIGPLAN conf. on compiler constr., Montreal.","DOI":"10.1145\/502874.502880"},{"key":"4_CR8","series-title":"LNCS","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-13346-1","volume-title":"Semantics of data types","author":"G. Kahn","year":"1984","unstructured":"G. Kahn, D.B. MacQueen and G. Plotkin (eds.) [1984] Semantics of data types, LNCS 173, Springer, Heidelberg."},{"key":"4_CR9","unstructured":"J.W. Klop [1980] Combinatory reduction systems, Mathematical Center Tracts, Kruislaan 413, 1098 SJ Amsterdam."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. Landin","year":"1964","unstructured":"P. Landin [1964] The mechanical evaluation of expressions, Computer Journal 6, 308\u2013320.","journal-title":"Computer Journal"},{"issue":"2","key":"4_CR11","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","volume":"8","author":"P. Landin","year":"1965","unstructured":"[1965] A correspondence between Algol 60 and Church's lambda notation, Comm.ACM, 8(2), 89\u2013101, 158\u2013165.","journal-title":"Comm.ACM"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/B978-0-08-011356-2.50008-2","volume-title":"Advances in programming and nonnumerical computation","author":"P. Landin","year":"1966","unstructured":"[1966] A lambda calculus approach, in: Advances in programming and nonnumerical computation (L. Fox ed.), Pergamon Press, Oxford, 97\u2013141."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P. Landin","year":"1966","unstructured":"[1966a] The next 700 programming languages, Comm. ACM, 9, 157\u2013166.","journal-title":"Comm. ACM"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"D. MacQueen, G. Plotkin and R. Sethi [1984] An ideal model for recursive polymorphic types, Eleventh Annual ACM Symposium on Principles of Programming Languages, January 1984, Salt Lake City, Utah.","DOI":"10.1145\/800017.800528"},{"key":"4_CR15","series-title":"LNCS","first-page":"408","volume-title":"proc. Colloque sur la programmation","author":"J.C. Reynolds","year":"1974","unstructured":"J.C. Reynolds [1974] Towards a theory of type structure, proc. Colloque sur la programmation, LNCS 19, Springer, Heidelberg, 408\u2013425."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott [1976] Data types as lattices, Siam J. of comput. 5, 522\u2013587.","journal-title":"Siam J. of comput."},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. Turner","year":"1979","unstructured":"D. Turner [1979] A new implementation technique for applicative languages, Software prctice and experience 9, 31\u201349.","journal-title":"Software prctice and experience"},{"key":"4_CR18","volume-title":"SASL language manual, preprint obtainable at Computer Laboratory","author":"D. Turner","year":"1979","unstructured":"[1979a] SASL language manual, preprint obtainable at Computer Laboratory, University of Kent, Canterburry, England."},{"key":"4_CR19","series-title":"Lecture Notes Computer Science","first-page":"1","volume-title":"Functional programming languages and computer architecture","author":"D. Turner","year":"1985","unstructured":"[1985] Miranda: a non-strict functional language with polymorphic types, in: Functional programming languages and computer architecture (Ed. J.-P. Jouannaod), Lecture Notes Computer Science 101, Springer, Heidelberg, 1\u201316."}],"container-title":["Lecture Notes in Computer Science","Current Trends in Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0027041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:07:11Z","timestamp":1736104031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0027041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164883","9783540398271"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0027041","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}