{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:00:54Z","timestamp":1725645654120},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540189947"},{"type":"electronic","value":"9783642734519"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/978-3-642-73451-9_15","type":"book-chapter","created":{"date-parts":[[2011,12,26]],"date-time":"2011-12-26T13:37:21Z","timestamp":1324906641000},"page":"178-197","source":"Crossref","is-referenced-by-count":0,"title":["System Architectures for Functional Programming Languages: Problems and Solutions"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Berkling","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Backus J., Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communicatios of ACM, Vol. 21, August 1987, pp. 280\u2013294."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Berkling K.J., Reduction Languages for Reduction Machines. In: Proc 2nd Int. Symp. Computer Architecture. Houston, Jan. 1975. New York, ACM-IEEE 75CH0916-7c, pp. 133\u2013140.","DOI":"10.1145\/642089.642112"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Berkling K.J., A Consistent Extension of the Lambda Calculus as a Base for Functional Languages. (with E. Fehr) Information and Control, 55(1\u20133): 89\u2013101.","DOI":"10.1016\/S0019-9958(82)90458-2"},{"key":"15_CR4","series-title":"Technical Report","volume-title":"Headorder Reduction: a Graph Reduction Scheme for the Operational Lambda Calculus","author":"KJ Berkling","year":"1986","unstructured":"Berkling K.J., Headorder Reduction: a Graph Reduction Scheme for the Operational Lambda Calculus, Technical Report No.8613, CASE Center, Syracuse, 1986, also: Conference Proceedings of the Graph Reduction Workshop, 1986, Santa Fe, New Mexico."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"NG Bruijn de","year":"1972","unstructured":"de Bruijn N.G., Lambda Calculus notation with nameless dummies. Indag Math. 34, pp. 381\u2013392, 1972.","journal-title":"Indag Math."},{"key":"15_CR6","unstructured":"Church A., The Calculi of Lambda-Conversions. 1941, Princeton University Press."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Clarke T.J.W., Gladstone P.J.S., MacLean C.D., Norman A.C., SKIM \u2014 S,K,I, Reduction Machine. August 1980, Proceedings 1980 Lisp Conference, Stanford, California.","DOI":"10.1145\/800087.802798"},{"key":"15_CR8","unstructured":"Curry H.B., Feys R., Combinatory Logic Voume 1, 1958, North Holland."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Hughes R.J.M., SUPER-COMBINATORS: A New Implementation Technique for Applicative Languages, August 1982, Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming, Pittsburg, Pennsylvania.","DOI":"10.1145\/800068.802129"},{"key":"15_CR10","volume-title":"The G-Machine: an Abstract Machine for Graph Reduction","author":"T Johnsson","year":"1983","unstructured":"Johnsson T., The G-Machine: an Abstract Machine for Graph Reduction. August 1983, Programming Methodology Group, Chalmers University of Technology, G\u00f6teborg, Sweden."},{"key":"15_CR11","unstructured":"Kenneway J.R., and Sleep M.R., Director strings as combinators. Department of Computer Science, University of East Anglia."},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"PJ Landin","year":"1964","unstructured":"Landin P.J., The mechanical evaluation of expressions. Computer Journal, Vol. 6, 1964, pp. 308\u2013320.","journal-title":"Computer Journal"},{"issue":"5","key":"15_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00995174","volume":"8","author":"GA Mago","year":"1979","unstructured":"Mago, G.A., A network of microprocessors to execute reduction languages. Two parts. International Journal of Computers and Information Sciences 8,5 (1979), 349\u2013385, 8, 6, (1979), pp. 435\u2013471.","journal-title":"International Journal of Computers and Information Sciences"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"DA Turner","year":"1979","unstructured":"Turner D.A., A New Implementation Technique for Applicative Languages. Software Practice and Experience, Vol. 9, 1979, pp. 31\u201349.","journal-title":"Software Practice and Experience"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Scheevel M., NORMA: a graph reduction processor. In Proceedings of the 1986 ACM Symposium on Lisp and Functional Programming, Cambridge Mass., 1986.","DOI":"10.1145\/319838.319864"},{"key":"15_CR16","unstructured":"Schoenfinckel M., On the Building Blocks of Mathematical Logic, 1924, From Frege to G\u00f6del: A Sourcebook in Mathematical Logic, van Heijenoort Ed."}],"container-title":["Informatik-Fachberichte","Architektur und Betrieb von Rechensystemen"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-73451-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T12:36:29Z","timestamp":1620304589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-73451-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540189947","9783642734519"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-73451-9_15","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1988]]}}}