{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:03:33Z","timestamp":1725631413944},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540127345"},{"type":"electronic","value":"9783642692987"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/978-3-642-69298-7_7","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T17:50:24Z","timestamp":1320774624000},"page":"67-85","source":"Crossref","is-referenced-by-count":1,"title":["An Algebraic Semantics for Backus\u2019 Functional Programming Language with Infinite Objects"],"prefix":"10.1007","author":[{"given":"Walter","family":"Dosch","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"M\u00f6ller","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"7_CR1","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J Backus","year":"1978","unstructured":"J. Backus: Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Comm. ACM 21: 8, 613\u2013641 (1978)","journal-title":"Comm. ACM"},{"key":"7_CR2","first-page":"2111","volume-title":"Formalization of Programming Concepts. Lecture Notes in Computer Science","author":"J Backus","year":"1981","unstructured":"J. Backus: The algebra of functional programs: Function level reasoning, linear equations, and extended definitions. In: J. Diaz, I. Ramos (eds.): Formalization of Programming Concepts. Lecture Notes in Computer Science 107. Berlin-Heidelberg-New York: Springer 1981, 2111"},{"key":"7_CR3","first-page":"133","volume-title":"J.W","author":"J Backus","year":"1981","unstructured":"J. Backus: Is computer science based on the wrong fundamental concept of \u2018program\u2019? An extended concept. In: J.W. de Bakker, J.C. van Vliet (eds.): Algorithmic Languages. Proceedings of an International Symposium on Algorithmic Languages. Amsterdam-New York-Oxford: North-Holland 1981, 133\u2013165"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"J. Backus: Function Level Programs as Mathematical Objects. ACM Conference on Functional Programming Languages and Computer Architecture, Portsmouth, N.H., 1\u201310 (1981)","DOI":"10.1145\/800223.806757"},{"key":"7_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61807-9","volume-title":"Algorithmic Language and Program Development","author":"FL Bauer","year":"1982","unstructured":"F.L. Bauer, H. Wssner: Algorithmic Language and Program Development. BerlinHeidelberg-New York: Springer (1982)"},{"key":"7_CR6","unstructured":"F.L. Bauer, M. Broy, W. Dosch, F. Geiselbrechtinger, W. Hesse, B. Krieg-BrOckner, A. Laut, T. Matzner, B. Moller, H. Partsch, P. Pepper, K. Samelson, M. Wirsing, H. WSssner: Report on a wide spectrum language for program specification and development (tentative version). Technische Universit\u00e4t MOnchen, Institut fOr Informatik, TUM-I8104, May 1981"},{"key":"7_CR7","volume-title":"Structured algebraic specification of Backus functional programming language. Unpublished manuscript","author":"M Broy","year":"1983","unstructured":"M. Broy: Structured algebraic specification of Backus\u2019 functional programming language. Unpublished manuscript. Technische Universit\u00e4t MOnchen, Institut f\u00fcr Informatik, May 1983"},{"issue":"2","key":"7_CR8","first-page":"137","volume":"17","author":"M Broy","year":"1983","unstructured":"M. Broy, M. Wirsing: Algebraic definition of a functional programming language and its semantic models. R.A.I.R.0. Informatique th\u00e9orique\/Theoretical Informatics 17: 2, 137\u2013161 (1983)","journal-title":"Informatique th\u00e9orique\/Theoretical Informatics"},{"key":"7_CR9","first-page":"257","volume-title":"Automata, languages and programming","author":"DP Friedman","year":"1976","unstructured":"D.P. Friedman, D.S. Wise: CONS should not evaluate its arguments. In: S. Michaelson, R. Milner (eds.): Automata, languages and programming. Edinburgh: Edinburgh University Press 1976, 257\u2013285"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"JA Goguen","year":"1977","unstructured":"J.A. Goguen, J.W. Thatcher, E.G. Wagner, J.B. Wright: Initial algebra semantics and continuous algebras. Journal ACM 24: 1, 68\u201395 (1977)","journal-title":"Journal ACM"},{"key":"7_CR11","first-page":"59","volume-title":"Ph.D. Thesis, University of Toronto, Department of Computer Science","author":"JV Guttag","year":"1975","unstructured":"J.V. Guttag: The specification and application to programming of abstract data types. Ph.D. Thesis, University of Toronto, Department of Computer Science, Report CSRG-59 (1975)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"R. Henderson, J. H. Morris: A lazy evaluator. Proc. 3rd ACM Symposium on Principles of Programming Languages, 1976, 95\u2013103","DOI":"10.1145\/800168.811543"},{"key":"7_CR13","first-page":"41","volume-title":"Transformations of FP Program Schemes. Proc","author":"RB Kieburtz","year":"1981","unstructured":"R.B. Kieburtz: Transformations of FP Program Schemes. Proc. ACM Conference on Functional Programming Languages and Computer Architecture, Portsmouth, N.H., 1981, 41\u201348"},{"issue":"6","key":"7_CR14","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/BF00995498","volume":"8","author":"GA Mag\u00f3","year":"1979","unstructured":"G.A. Mag\u00f3: A network of microprocessors to execute reduction languages. International Journal on Computer and Information Systems 8:5, 349\u2013385, 8: 6, 435\u2013471 (1979)","journal-title":"International Journal on Computer and Information Systems 8:5, 349-385"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J McCarthy","year":"1960","unstructured":"J. McCarthy: Recursive functions of symbolic expressions and their computation by machine, part I. Comm. ACM 3: 4, 184\u2013195 (1960)","journal-title":"Comm. ACM"},{"key":"7_CR16","volume-title":"Technische Universit\u00e4t MOnchen, Institut fUr Informatik","author":"B Moller","year":"1982","unstructured":"B. Moller: Unendliche Objekte and Geflechte. Fakult\u00e2t fUr Mathematik and Informatik der Technischen Universit\u00e4t MOnchen, Dissertation. Technische Universit\u00e4t MOnchen, Institut fUr Informatik, TUM-I8213, September 1982"},{"key":"7_CR17","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BFb0036933","volume-title":"Automata, Languages and Programming. Lecture Notes in Computer Science","author":"B M\u00f3ller","year":"1983","unstructured":"B. M\u00f3ller: An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language. In: J. Diaz (ed.): Automata, Languages and Programming. Lecture Notes in Computer Science 154. Berlin-Heidelberg-New York: Springer 1983, 513\u2013526"},{"key":"7_CR18","first-page":"107","volume-title":"formatik-Spektrum 5","author":"P Pepper","year":"1982","unstructured":"P. Pepper, M. Broy, F.L. Bauer, H. Partsch, W. Dosch, M. Wirsing: Abstrakte Datentypen: Die algebraische Spezifikation von Rechenstrukturen. In formatik-Spektrum 5, 107\u2013119 (1982)"},{"key":"7_CR19","unstructured":"B. Robinet: Un niod\u00e9le logico-combinatoire des systemes de Backus. Universit\u00e9 Paris 7, Laboratoire Informatique Theorique et Programmation, Rapport No 80\u201321, April 1980"},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/356869.356873","volume":"14","author":"PC Treleaven","year":"1982","unstructured":"P.C. Treleaven, D.R. Brownbridge, R.P. Hopkins: Data-driven and demand-driven computer architecture. Computing Surveys 14: 1, 93\u2013143 (1982)","journal-title":"Computing Surveys"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0022-0000(74)80036-X","volume":"9","author":"J.Vuillemin","year":"1974","unstructured":"J.Vuillemin: Correct and optimal implementations of recursion in a simple programming language. Journal of Computer and Systems Science 9, 31\u201349 (1974)","journal-title":"Journal of Computer and Systems Science"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/69622.357193","volume":"4","author":"JH Williams","year":"1982","unstructured":"J.H. Williams: On the development of the algebra of functional programs. ACM Transactions on Programming Languages 4: 4, 733\u2013757 (1982)","journal-title":"ACM Transactions on Programming Languages"},{"key":"7_CR23","volume-title":"Acta Informatica (to appear","author":"M Wirsing","year":"1983","unstructured":"M. Wirsing, P. Pepper, H. Partsch, W. Dosch, M. Broy: On hierarchies of abstract data types. Acta Informatica (to appear 1983 )"}],"container-title":["Informatik-Fachberichte","GI - 13. Jahrestagung"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-69298-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:27:12Z","timestamp":1606256832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-69298-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540127345","9783642692987"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-69298-7_7","relation":{},"ISSN":["0343-3005"],"issn-type":[{"type":"print","value":"0343-3005"}],"subject":[],"published":{"date-parts":[[1983]]}}}