{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:10Z","timestamp":1725664150296},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606758"},{"type":"electronic","value":"9783540492528"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60675-0_48","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:51:48Z","timestamp":1330289508000},"page":"231-249","source":"Crossref","is-referenced-by-count":0,"title":["Using \u03c0-RED as a teaching tool for functional programming and program execution"],"prefix":"10.1007","author":[{"given":"Werner E.","family":"Kluge","sequence":"first","affiliation":[]},{"given":"Carsten","family":"Rathsack","sequence":"additional","affiliation":[]},{"given":"Sven-Bodo","family":"Scholz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"14_CR1","volume-title":"Structure and Interpretation of Computer Programs","author":"H. Abelson","year":"1985","unstructured":"Abelson, H.; Sussmann, G.J.: Structure and Interpretation of Computer Programs, MIT Press, McGraw-Hill, New York, NY, 1985"},{"issue":"No.8","key":"14_CR2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J.: Can Programming Be Liberated from the von Neumann Style? A Functional Style and Its Algebra of Programs, Communications of the ACM, Vol. 21, No. 8, 1978, pp. 613\u2013641","journal-title":"Communications of the ACM"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Berkling, K.J.: Reduction Languages for Reduction Machines, Proceedings of the 2nd Annual Symposium on Computer Architecture, 1975, ACM\/IEEE 75CH0916-7C, pp. 133\u2013140","DOI":"10.1145\/642089.642112"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Berkling, K.J.; Fehr, E.: A Consistent Extension of the Lambda-Calculus as a Base for Functional Programming Languages, Information and Control, Academic Press, Vol. 55, Nos. 1\u20133, October\/November\/December 1982","DOI":"10.1016\/S0019-9958(82)90458-2"},{"key":"14_CR5","volume-title":"The ML\/LCF\/HOPE Newsletter","author":"L. Cardelli","year":"1983","unstructured":"Cardelli, L.; McQueen, D.: The Functional Abstract Machine The ML\/LCF\/HOPE Newsletter, AT&T, Bell Labs, Murray Hill NJ, 1983"},{"key":"14_CR6","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.: Lambda-Calculus Notation with Nameless Dummies. A Tool for Automatic Formula Manipulation with Application to the Church-Rosser-Theorem, Indagationes Mathematicae, Vol. 34, 1972, pp. 381\u2013392","journal-title":"Indagationes Mathematicae"},{"key":"14_CR7","unstructured":"Gaertner, D., Kluge, W.E.: \u03c0-red +: An Interactive Compiling Graph Reduction System for an Applied \u03bb-Calculus, to be published in JFP"},{"issue":"No.3","key":"14_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1093\/comjnl\/37.3.177","volume":"37","author":"D. Goldson","year":"1994","unstructured":"Goldson, D.: A Symbolic Calculator for Non-Strict Functional Programs The Computer Journal, Vol. 37, No. 3, 1994, pp. 177\u2013187","journal-title":"The Computer Journal"},{"key":"14_CR9","unstructured":"Harper, R.; Milner, R.; Tofte, M.: The Definition of Standard ML Version 3, Laboratory for Foundations of Computer Science, University of Edinburgh, May 1989"},{"key":"14_CR10","unstructured":"Hudak, P.; Wadler, P. (Editors) et al.: Report on the Functional Programming Language: Haskell, Draft Proposed Standard, December 1988, Yale University"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Johnsson, T.: Efficient Compilation of Lazy Evaluation SIGPLAN Compiler Construction Conference, Montreal Queb., 1984","DOI":"10.1145\/502874.502880"},{"key":"14_CR12","volume-title":"The Organization of Reduction, Data Flow, and Control Flow Systems","author":"W.E. Kluge","year":"1992","unstructured":"Kluge, W.E.: The Organization of Reduction, Data Flow, and Control Flow Systems, MIT Press, Cambridge, Mass., 1992"},{"key":"14_CR13","volume-title":"Int. Report, No. 9419","author":"W.E. Kluge","year":"1994","unstructured":"Kluge, W.E.: A User's Guide for the Reduction System \u03c0-Red, Int. Report, No. 9419, Inst. f. Informatik, CAU Kiel, 1994."},{"issue":"No.4","key":"14_CR14","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P.J. Landin","year":"1964","unstructured":"Landin, P.J.: The Mechanical Evaluation of Expressions, The Computer Journal, Vol. 6, No. 4, 1964, pp. 308\u2013320","journal-title":"The Computer Journal"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Laville, A.: Lazy Pattern Matching in the ML Language, INRIA Rapporte de Recherche, No. 664, 1987","DOI":"10.1007\/3-540-18625-5_64"},{"key":"14_CR16","unstructured":"Plasmeijer, R., van Eekelen, M.: Functional Programming and Parallel Graph Rewriting, Addison Wesley, 1993"},{"key":"14_CR17","volume-title":"The Implementation of Functional Programming Languages","author":"S.L. Peyton-Jones","year":"1987","unstructured":"Peyton-Jones, S.L.: The Implementation of Functional Programming Languages, Prentice Hall, Englewood Cliffs, NJ, 1987"},{"issue":"No.2","key":"14_CR18","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S.L. Peyton-Jones","year":"1992","unstructured":"Peyton-Jones, S.L.: Implementing Lazy Functional Languages on Stock Hardware: The Spineless Tagless G-Machine, Journal of Functional Programming, Vo. 2, No. 2, 1992, pp. 127\u2013202","journal-title":"Journal of Functional Programming"},{"issue":"No.1","key":"14_CR19","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1017\/S0956796800000629","volume":"3","author":"C. Runciman","year":"1993","unstructured":"Runciman, C.; Toyn, I.; Firth, M.: An Incremental, Exploratory and Transformational Environment for Lazy Functional Languages, Journal of Functional Programming, Vol. 3, No. 1, 1993, pp. 93\u2013115","journal-title":"Journal of Functional Programming"},{"issue":"No.1","key":"14_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D.A. Turner","year":"1979","unstructured":"Turner, D.A.: A New Implementation Technique for Applicative Languages Software Practice and Experience, Vol. 9, No. 1, 1979, pp. 31\u201349","journal-title":"Software Practice and Experience"},{"issue":"No.12","key":"14_CR21","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/15042.15053","volume":"21","author":"D.A. Turner","year":"1986","unstructured":"Turner, D.A.: An Overview of Miranda, SIGPLAN Notices, Vol. 21, No. 12, 1986, pp. 158\u2013166","journal-title":"SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","Funtional Programming Languages in Education"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60675-0_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:11Z","timestamp":1605646871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60675-0_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606758","9783540492528"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-60675-0_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}