{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:36:56Z","timestamp":1649183816605},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf03037478","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:05:32Z","timestamp":1240542332000},"page":"173-195","source":"Crossref","is-referenced-by-count":3,"title":["\u03c0-RED*\u2014A graph reducer for a full-fledged \u03b3-calculus"],"prefix":"10.1007","volume":"10","author":[{"given":"C.","family":"Schmittgen","sequence":"first","affiliation":[]},{"given":"H.","family":"Bl\u00f6dorn","sequence":"additional","affiliation":[]},{"given":"W.","family":"Kluge","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037478_CR1","doi-asserted-by":"crossref","unstructured":"Appel, A. W. and MacQueen, D. M., \u201cA Standard ML Compiler,\u201dACM Conference on Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science, 274, Portland Oregon, pp. 301\u2013324, Sept., 1987.","DOI":"10.1007\/3-540-18317-5_17"},{"key":"BF03037478_CR2","unstructured":"Backus, J., \u201cReduction Languages and Variable-Free Programming,\u201dIBM Research Report, RJ 1010, April 7, 1973."},{"key":"BF03037478_CR3","doi-asserted-by":"crossref","unstructured":"Backus, J., \u201cProgramming Language Semantics and Closed Applicative Languages,\u201d inProc. of the 1st ACM Symposium on Principles of Programming Languages, Boston, Massachusetts, pp. 71\u201386, October, 1973.","DOI":"10.1145\/512927.512934"},{"key":"BF03037478_CR4","doi-asserted-by":"crossref","unstructured":"Berkling, K. J., \u201cReduction Laguages for Reduction Machines,\u201d inProc. of the 2nd Annual Symposium on Computer Architecture, ACM\/IEEE, pp. 133\u2013140, Jan., 1975.","DOI":"10.1145\/642089.642112"},{"key":"BF03037478_CR5","unstructured":"Berkling, K. J., \u201cA Symmetric Complement to the Lambda Calculus\u201d,Internal Report, GMD ISF-76-7, D-5205, Sankt Augustin 1, Sept. 14, 1976."},{"key":"BF03037478_CR6","series-title":"Information and Control","volume-title":"A Consistent Extension of the Lambda-Calculus as a Base for Functional Programming Languages","author":"K. J. Berkling","year":"1982","unstructured":"Berkling, K. J. and Fehr, E., \u201cA Consistent Extension of the Lambda-Calculus as a Base for Functional Programming Languages,\u201dInformation and Control, 55, 1-3, Academic Press, New York, Oct.\/Nov.\/Dec., 1982."},{"key":"BF03037478_CR7","unstructured":"Kluge, W., Schmittgen, C., and Zimmer, R., \u201c\u03c0-RED\u2014An Interactive Reduction System Based on a Full-Fledged \u03b3-Calculus,\u201d to appear inProc. of the Workshop on Architectural Support for Declarative Programming Languages, Eilat, Israel, May, 1989."},{"key":"BF03037478_CR8","doi-asserted-by":"crossref","unstructured":"Cardelli, L. and Wegner, P., \u201cOn Understanding Types, Data Abstraction, and Polymorphism,\u201dACM Computing Surveys, 17, December 4, 1985.","DOI":"10.1145\/6041.6042"},{"key":"BF03037478_CR9","unstructured":"Church, A.,The Calculi of Lambda Conversion, Princeton University Press, 1941."},{"key":"BF03037478_CR10","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N. G. DeBruijn","year":"1972","unstructured":"DeBruijn, N. G., \u201cLambda-Calculus Notation with Nameless Dummies. A Tool for Automatic Formula Manipulation with Application to the Church-Rosser-Theorem,\u201dIndagationes Mathematicae, 34, pp. 381\u2013392, 1972.","journal-title":"Indagationes Mathematicae"},{"key":"BF03037478_CR11","doi-asserted-by":"crossref","unstructured":"Fairbairn, J. and Wray, S. C., \u201cTIM: A Simple, Lazy Abstract Machine to Execute Supercombinators,\u201dACM Conference on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science, 274, Portland, Oregon, September, 1987.","DOI":"10.1007\/3-540-18317-5_3"},{"key":"BF03037478_CR12","unstructured":"Harland, D. M.Polymorphic Programming Languages, Ellis Horwood, 1984."},{"key":"BF03037478_CR13","unstructured":"Harper, R., MacQueen, D. M., and Milner, R.Standard ML, Edinburgh-LFCS, March, 1986."},{"key":"BF03037478_CR14","unstructured":"Harper, R., Milner, R., and Tofte, M.,The Definition of Standard ML Version 2, University of Edinburgh, LFCS, August, 1988."},{"key":"BF03037478_CR15","doi-asserted-by":"crossref","unstructured":"Hommes, F., The Heap\/Substitution Concept\u2014An Implementation of Functional Operations on Data Structures for a Reduction Machine, inProc. of the 9th Annual Symposium on Computer Architecture, Austin, Texas, pp. 248\u2013256, April, 1982.","DOI":"10.1145\/1067649.801733"},{"key":"BF03037478_CR16","doi-asserted-by":"crossref","unstructured":"Hudak, P. and Kranz, D., \u201cA Combinator-Based Compiler for a Functional Language,\u201d inProc. of the 11th ACM Symposium on Principles of Programming Languages, 1984.","DOI":"10.1145\/800017.800523"},{"key":"BF03037478_CR17","doi-asserted-by":"crossref","unstructured":"Hughes, R. J., \u201cSuper-Combinators: A New Implementation Method for Applicative Languages,\u201d inProc. of the ACM Symposium on LISP and Functional Programming, Pittsburgh, PA, pp. 1\u201310, Aug., 1982.","DOI":"10.1145\/800068.802129"},{"issue":"6","key":"BF03037478_CR18","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1145\/502949.502880","volume":"19","author":"T. Johnsson","year":"1984","unstructured":"Johnsson, T., \u201cEfficient Compilation of Lazy Evaluation,\u201dSIGPLAN Notices, 19, 6, pp. 58\u201369, June, 1984.","journal-title":"SIGPLAN Notices"},{"key":"BF03037478_CR19","unstructured":"Johnsson, T., \u201cThe G-Machine an Abstract Machine for Graph Reduction,\u201dSERC Chalmers University, Deductive Programming Workshop, University College London, May, 1983."},{"key":"BF03037478_CR20","doi-asserted-by":"crossref","unstructured":"Johnsson, T., \u201cLambda Lifting: Transforming Programs to Recursive Equations,\u201dACM Conference on Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science, 201, Nancy, Sept., 1985.","DOI":"10.1007\/3-540-15975-4_37"},{"key":"BF03037478_CR21","unstructured":"Kluge, W. E., \u201cThe Architecture of the Reduction Machine Hardware Model,\u201dInternal Report, GMD ISF-79-3, D-5205, Sankt Augustin, Aug., 1979."},{"key":"BF03037478_CR22","unstructured":"Kluge, W. E. and Schl\u00fctter, H., \u201cAn Architecture for Direct Execution of Reduction Languages,\u201d inProc. of the International Workshop on High-Level Language Computer Architecture, Fort Lauderdale, Florida, Dec., 1983."},{"key":"BF03037478_CR23","doi-asserted-by":"crossref","unstructured":"Milner, R., \u201cA Theory of Type Polymorphism in Programming,\u201dJournal of Computer and System Science, pp. 348\u2013375, 1978.","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"BF03037478_CR24","doi-asserted-by":"crossref","unstructured":"Peyton Jones S. L. and Salkild, J., \u201cThe Spineless Tagless G-Machine,\u201dACM Conference on Functional Programming Languages and Computer Architecture, London, Sept., 1989.","DOI":"10.1145\/99370.99385"},{"key":"BF03037478_CR25","unstructured":"Pless, E. and Schl\u00fctter, H., \u201cThe Reduction Language OREL\/2,\u201dArbeitspapiere der GMD, 1989."},{"key":"BF03037478_CR26","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,\u201dSoftware Practice and Experience, 9, pp. 31\u201349, 1979.","journal-title":"Software Practice and Experience"},{"key":"BF03037478_CR27","doi-asserted-by":"crossref","unstructured":"Turner, D. A., \u201cMiranda: A Non-Strict Language with Polymorphic Types,\u201dACM Conference on Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science, 201, Nancy, 1985.","DOI":"10.1007\/3-540-15975-4_26"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037478.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037478\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037478","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:52:38Z","timestamp":1558572758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF03037478"],"URL":"https:\/\/doi.org\/10.1007\/bf03037478","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}