{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:50:59Z","timestamp":1725663059701},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540184201"},{"type":"electronic","value":"9783540479635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18420-1_48","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:34:46Z","timestamp":1330198486000},"page":"26-48","source":"Crossref","is-referenced-by-count":1,"title":["Head order reduction: A graph reduction scheme for the operational lambda calculus"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Berkling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1017\/S0022481200051914","volume":"41","author":"S.K. Abdali","year":"1976","unstructured":"Abdali, S.K., \u201cAn Abstraction Algorithm for Combinatory Logic\u201d, The Journal of Symbolic Logic 41, 1, March 1976, pp. 222\u2013224.","journal-title":"The Journal of Symbolic Logic"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0022-0000(81)90073-8","volume":"23","author":"L. Aiello","year":"1981","unstructured":"Aiello, L. and Prini, G., \u201cAn Efficient Interpreter for the Lambda-Calculus\u201d, Journal of Computer and System Sciences 23, pp. 383\u2013424 (1981).","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR3","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1981","unstructured":"Barendregt, H.P., The Lambda Calculus: Its Syntax and Semantics, North-Holland Publishing Co., Amsterdam, Netherlands, 1981 and 1984."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Berkling, K.J., \u201cReduction Languages for Reduction Machines\u201d, Proceedings of the 2nd International Symposium on Computer Architecture, Houston, January 1975, pp. 133\u2013140.","DOI":"10.1145\/642089.642112"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Berkling, K.J., and Fehr, E., \u201cA Consistent Extension of the Lambda Calculus as a Base for Functional Languages\u201d, Information and Control 55, 1\u20133, pp. 89\u2013101.","DOI":"10.1016\/S0019-9958(82)90458-2"},{"key":"2_CR6","unstructured":"Church, A., The Calculi of Lambda-Conversion, 1941, Princeton University Press."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Clarke, T.J.W., Gladstone, P.J.S., Maclean, C.D., and Norman, A.C., \u201cSKIM \u2014 S, K, I, Reduction Machine\u201d, Proceedings 1980 Lisp Conference, Stanford, California, August 1980.","DOI":"10.1145\/800087.802798"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"De Bruijn, N.G., \u201cLambda-calculus notation with nameless dummies: A tool for automatic formula manipulation with application to the Church-Rosser theorem\u201d, Indag. Math. 34, pp. 381\u2013392.","DOI":"10.1016\/1385-7258(72)90034-0"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Hughes, R.J.M., \u201cSUPER-COMBINATORS: A New Implementation Method for Applicative Languages\u201d, 1982 ACM Symposium on Lisp and Functional Programming, Pittsburgh, Pennsylvania, August 1982.","DOI":"10.1145\/800068.802129"},{"key":"2_CR10","unstructured":"Greene, K.J., \u201cA Fully Lazy Higher Order Purely Functional Language with Reduction Semantics\u201d, CASE Center Technical Report No. 8503, Syracuse University."},{"key":"2_CR11","unstructured":"Johnsson, T., \u201cThe G-Machine: An Abstract Machine for Graph Reduction\u201d, Chalmers University of Technolgy, Goteborg, Sweden, August 1983."},{"key":"2_CR12","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C., Introduction to Metamathematics, Van Nostrand, New York, 1952."},{"key":"2_CR13","unstructured":"Morris, F.L., \u201cComputing Cyclic Liststructure\u201d, School of Information and Computer Science, Report 2\u201380, Syracuse University, June 1980."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Scheevel, M., \u201cNORMA: A Graph Reduction Processor\u201d, 1986 ACM Conference on LISP and Functional Programming, August 1986.","DOI":"10.1145\/319838.319864"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"Turner, D.A., \u201cA New Implementation Technique for Applicative Languages\u201d, Software\u2014Practice and Experience 9, September 1979, pp. 31\u201349.","journal-title":"Software\u2014Practice and Experience"},{"key":"2_CR16","unstructured":"Wadsworth, C.P., Semantics and Pragmatics of the Lambda Calculus, Ph.D. Thesis, Oxford University, September 1971."}],"container-title":["Lecture Notes in Computer Science","Graph Reduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18420-1_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:14:50Z","timestamp":1605644090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}