{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:10:06Z","timestamp":1742591406339,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_47","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:34:19Z","timestamp":1330198459000},"page":"1-25","source":"Crossref","is-referenced-by-count":1,"title":["On the correspondence of lambda style reduction and combinator style reduction"],"prefix":"10.1007","author":[{"given":"Hans-Georg","family":"Oberhauser","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"T.J.W. Clarke, P.J.S. Gladstone, C.D. MacLean and A.C. Norman, \u201cSKIM \u2014 The S, K, I Reduction Machine\u201d, Procedings of the 1980 ACM Lisp Conference, p. 128\u2013135, Aug. 1980.","DOI":"10.1145\/800087.802798"},{"key":"1_CR2","unstructured":"P. Henderson, \u201cFunctional Programming: Application and Implementation\u201d, Prentice-Hall International Series in Computer Science, 1980."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"P. Hudak and D. Kranz, \u201cA Combinator-based Compiler for a Functional Language\u201d, Eleventh annual ACM Symposium on Principles of Programming Languages, January 1984.","DOI":"10.1145\/800017.800523"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"R. J. M. Hughes, \u201cSuper-Combinators\u201d, Conference Record of the 1982 ACM Symposium on LISP and Functional Programming1\u201310, 1982.","DOI":"10.1145\/800068.802129"},{"key":"1_CR5","unstructured":"T. Ida and A. Konagaya, \u201cComparison of closure reduction and combinator reduction schemes\u201d, unpublished, 1984."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Simon Peyton Jones, \u201cAn Investigation on the Relative Efficiencies of Combinators and Lambda Expressions\u201d, Conference Record od the 1982 ACM Symposium on Lisp and Functional Programming, p. 150\u2013158, Aug. 1982.","DOI":"10.1145\/800068.802145"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"M.S. Joy and V.J. Rayward-Smith, F.W. Burton, \u201cEfficient Combinator Code\u201d, Computer Lang. Vol. 10, No. 3\/4, 1985.","DOI":"10.1016\/0096-0551(85)90017-7"},{"key":"1_CR8","unstructured":"J.R. Kennaway, \u201cThe Complexity of a Translation of \u03bb-calculus to Combinators\u201d, Report CS\/82\/23\/E, p. University of East Anglia, 1982."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"H.G. Oberhauser, \u201cA Fully Lazy Lambda Style Graph Reducer\u201d, SFB 124-C1, 06\/1986, Universit\u00e4t des Saarlandes, West Germany, 1986.","DOI":"10.1007\/3-540-18420-1_47"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"H.G. Oberhauser, \u201cOn the Correspondence of Lambda Style Reduction and Combinator Style Reduction\u201d, SFB 124-C1, 02\/1986, Universit\u00e4t des Saarlandes, West Germany, 1986.","DOI":"10.1007\/3-540-18420-1_47"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"W.R. Stoye, T.J.W. Clarke and A.C. Norman, \u201cSome Practical Methods for Rapid Combinator Reduction\u201d, 1984 ACM Symposium on Lisp and Functional Programming, p. 159\u2013166, 1984.","DOI":"10.1145\/800055.802032"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"D.A. Turner, \u201cA new implementation technique for applicative languages\u201d, Software \u2014 Practice and Experience, 9, p. 31\u201349, Sept. 1979.","journal-title":"Software \u2014 Practice and Experience"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"D.A. Turner, \u201cAnother algorithm for bracket abstraction\u201d, The Journal of Symbolic Logic, 44, June 1979.","DOI":"10.2307\/2273733"},{"key":"1_CR14","unstructured":"C. P. Wadsworth, \u201cSemantics and Pragmatics of the Lambda-Calculus.\u201d, Ph.D Thesis, Oxford University, 1971."},{"key":"1_CR15","unstructured":"D.S. Wise, \u201cInterpreters for Functional Languages\u201d, Functional Programming and it's Applications, an advanced course. Cambridge University Press, 1982."}],"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_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:37:50Z","timestamp":1742589470000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18420-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540184201","9783540479635"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-18420-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}