{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:18Z","timestamp":1725456018235},"publisher-location":"Berlin\/Heidelberg","reference-count":21,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057879X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017486","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:47:11Z","timestamp":1132627631000},"page":"246-260","source":"Crossref","is-referenced-by-count":1,"title":["On the first-order equivalence of call-by-name and call-by-value"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Noll","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"C.A. Albayrak. Vergleichende Gegen\u00fcberstellung der Parameter\u00fcbergabemechanismen Call-by-name und Call-by-value im Rahmen funktionaler Programme. Master's thesis, Aachen Univ. of Technology, March 1993. In German."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0304-3975(76)90031-1","volume":"2","author":"J.W. Bakker de","year":"1976","unstructured":"J.W. de Bakker. Least fixed points revisited. Theoretical Computer Science, 2:155\u2013181, 1976.","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1137\/0201017","volume":"1","author":"S. Brown","year":"1972","unstructured":"S. Brown, D. Gries, and T. Szymanski. Program schemes with pushdown stores. SIAM Journal on Computing, 1:242\u2013268, 1972.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"J.M. Cadiou. Recursive Definitions of Partial Functions and their Computations. PhD thesis, Stanford University, 1972.","DOI":"10.1145\/800235.807072"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0201006","volume":"1","author":"R.L. Constable","year":"1972","unstructured":"R.L. Constable and D. Gries. On classes of program schemata. SIAM Journal on Computing, 1:66\u2013118, 1972.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"B. Courcelle. Recursive applicative program schemes. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, chapter 9, pages 459\u2013492. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50014-7"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(82)90009-3","volume":"20","author":"W. Damm","year":"1982","unstructured":"W. Damm. The IO-and OI-hierarchies. Theoretical Computer Science, 20:95\u2013207, 1982.","journal-title":"Theoretical Computer Science"},{"key":"17_CR8","first-page":"461","volume-title":"Formal Description of Programming Concepts","author":"W. Damm","year":"1978","unstructured":"W. Damm, E. Fehr, and K. Indermark. Higher-type recursion and self-application as control structures. In E.J. Neuhold, editor, Formal Description of Programming Concepts, pages 461\u2013487. Elsevier (North-Holland), 1978."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","volume":"15","author":"J. Engelfriet","year":"1977","unstructured":"J. Engelfriet and E.M. Schmidt. IO and OI. Part I. Journal of Computer and System Sciences, 15:328\u2013353, 1977.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","volume":"16","author":"J. Engelfriet","year":"1978","unstructured":"J. Engelfriet and E.M. Schmidt. IO and OI. Part II. Journal of Computer and System Sciences, 16:67\u201399, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR11","volume-title":"PhD thesis","author":"M.J. Fischer","year":"1968","unstructured":"M.J. Fischer. Grammars with Macro-like Productions. PhD thesis, Harvard University, Cambridge, 1968."},{"issue":"2","key":"17_CR12","first-page":"202","volume":"101","author":"A. Goerdt","year":"1992","unstructured":"A. Goerdt. Characterizing complexity classes by general recursive definitions in higher types. Information and Control, 101(2):202\u2013218, 1992.","journal-title":"Information and Control"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"S.A. Greibach. Theory of Program Structures: Schemes, Semantics, Verification, volume 36 of Lecture Notes in Computer Science. Springer-Verlag, 1975.","DOI":"10.1007\/BFb0023017"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90210-7","volume":"93","author":"A.J. Kfoury","year":"1992","unstructured":"A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. On the expressive power of finitely typed and universally polymorphic recursive procedures. Theoretical Computer Science, 93:1\u201341, 1992.","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF00289503","volume":"2","author":"H. Langmaack","year":"1973","unstructured":"H. Langmaack. On procedures as open subroutines. Part I. Acta Informatica, 2:311\u2013333, 1973.","journal-title":"Acta Informatica"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00288636","volume":"3","author":"H. Langmaack","year":"1974","unstructured":"H. Langmaack. On procedures as open subroutines. Part II. Acta Informatica, 3:227\u2013241, 1974.","journal-title":"Acta Informatica"},{"key":"17_CR17","unstructured":"A. Mycroft. Abstract Interpretation and Optimizing Transformations for Applicative Programs. PhD thesis, University of Edinburgh, 1981."},{"key":"17_CR18","first-page":"255","volume":"15","author":"M. Nivat","year":"1975","unstructured":"M. Nivat. On the interpretation of recursive polyadic program schemes. Symposia Mathematica, 15:255\u2013281, 1975.","journal-title":"Symposia Mathematica"},{"key":"17_CR19","unstructured":"M.S. Paterson and C.E. Hewitt. Comparative schematology. In Record on Project MAC Conference on Concurrent Systems and Parallel Computation, pages 119\u2013128. ACM, 1970."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"G.D. Plotkin. Call-by-name, call-by-value, and the A-calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"W.-P. de Roever. First-order reduction of call-by-name to call-by-value. In Proc. 4th MFCS, volume 32 of Lecture Notes in Computer Science, pages 377\u2013398. Springer-Verlag, 1975.","DOI":"10.1007\/3-540-07389-2_223"}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP'94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017486.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:38:39Z","timestamp":1607531919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057879X"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0017486","relation":{},"subject":[]}}