{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T15:11:47Z","timestamp":1791213107111,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540525929","type":"print"},{"value":"9783540470458","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52592-0_60","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:40:02Z","timestamp":1330206002000},"page":"134-151","source":"Crossref","is-referenced-by-count":40,"title":["On the expressive power of programming languages"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Felleisen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.\n                The Lambda Calculus: Its Syntax and Semantics. Revised edition. Studies in Logic and the Foundations of Mathematics 103. North-Holland, Amsterdam, 1984."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0096-0551(75)90032-6","volume":"1","author":"A.K. Chandra","year":"1975","unstructured":"Chandra, A.K. and Z. Manna. The power of programming features. Journal of Computer Languages (Pergamon Press) 1, 1975, 219\u2013232.","journal-title":"Journal of Computer Languages"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","volume":"69","author":"M. Felleisen","year":"1989","unstructured":"Felleisen, M. and D.P. Friedman. A syntactic theory of sequential state. Theor. Comput. Sci.\n                69(sn3), 1989, 243\u2013287. Preliminary version in: Proc. 14th ACM Symposium on Principles of Programming Languages, 1987, 314\u2013325.","journal-title":"Theor. Comput. Sci."},{"key":"8_CR4","unstructured":"Felleisen, M. and R. Hieb. The revised report on the syntactic theories of sequential control and state. Technical Report 100, Rice University, June 1989."},{"issue":"3","key":"8_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., D.P. Friedman, E. Kohlbecker, and B. Duba. A syntactic theory of sequential control. Theor. Comput. Sci.\n                52(3), 1987, 205\u2013237. Preliminary version in: Proc. Symposium on Logic in Computer Science, 1986, 131\u2013141.","journal-title":"Theor. Comput. Sci."},{"key":"8_CR6","first-page":"80","volume-title":"Current Trends in Programming Methodology IV","author":"J. Goguen","year":"1979","unstructured":"Goguen, J., J. Thatcher, and E. Wagner. An initial algebra approach to the specification, correctness, and implementation of abstract data types. In Current Trends in Programming Methodology IV, edited by R. Yeh. Prentice-Hall, Englewood Cliffs, New Jersey, 1979, 80\u2013149."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Griffin, T. Notational definition\u2014A formal account. In Proc. Symposium on Logic in Computer Science, 1988, 372\u2013383.","DOI":"10.1109\/LICS.1988.5134"},{"key":"8_CR8","volume-title":"Introduction to Metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"Kleene, S. C.\n                Introduction to Metamathematics, Van Nostrand, New York, 1952."},{"key":"8_CR9","unstructured":"Kohlbecker, E.\n                Syntactic Extensions in the Programming Language Lisp. Ph.D. dissertation, Indiana University, 1986."},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P.J. Landin","year":"1966","unstructured":"Landin, P.J. The next 700 programming languages. Commun. ACM\n                9(3), 1966, 157\u2013166.","journal-title":"Commun. ACM"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Meyer, A.R. and J.R. Riecke. Continuations may be unreasonable. In Proc. 1988 Conference on Lisp and Functional Programming, 1988, 63\u201371.","DOI":"10.1145\/62678.62685"},{"key":"8_CR12","unstructured":"Morris, J.H.\n                Lambda-Calculus Models of Programming Languages. Ph.D. dissertation, MIT, 1968."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Ong, L C.-H. Fully abstract models of the lazy lambda-calculus. In Proc. 29th Symposium on Foundation of Computer Science, 1988, 368\u2013376.","DOI":"10.1109\/SFCS.1988.21953"},{"key":"8_CR14","unstructured":"Paterson, M.S. and C.E. Hewitt. Comparative schematology. In Conf. Rec. ACM Conference on Concurrent Systems and Parallel Computation, 1970, 119\u2013127."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D. LCF considered as a programming language. Theor. Comput. Sci.\n                5, 1977, 223\u2013255.","journal-title":"Theor. Comput. Sci."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D. Call-by-name, call-by-value, and the \u03bb-calculus. Theor. Comput. Sci.\n                1, 1975, 125\u2013159.","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"8_CR17","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1145\/362349.362364","volume":"13","author":"J.C. Reynolds","year":"1970","unstructured":"Reynolds, J.C. GEDANKEN\u2014A simple typeless language based on the principle of completeness and the reference concept. Commun. ACM\n                13(5), 1970, 308\u2013319.","journal-title":"Commun. ACM"},{"key":"8_CR18","first-page":"345","volume-title":"Algorithmic Languages","author":"J.C. Reynolds","year":"1981","unstructured":"Reynolds, J.C. The essence of Algol. In Algorithmic Languages, edited by de Bakker and van Vliet. North-Holland, Amsterdam, 1981, 345\u2013372."},{"key":"8_CR19","unstructured":"Steele, G.L., Jr. and G.J. Sussman. Lambda: The ultimate imperative. Memo 353, MIT AI Lab, 1976."},{"key":"8_CR20","unstructured":"Sussman, G.J. and G.L. Steele Jr. Scheme: An interpreter for extended lambda calculus. Memo 349, MIT AI Lab, 1975."},{"key":"8_CR21","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0066739","volume-title":"Metamathematical Investigation of Intuitionistic Arithmetic and Analysis","author":"A. S. Troelstra","year":"1973","unstructured":"Troelstra, A. S.\n                Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Lecture Notes in Mathematics 344. Springer-Verlag, Berlin, 1973."},{"key":"8_CR22","unstructured":"Williams, J.G. On the formalization of semantic conventions. Draft version: September 1988. To appear in Journal of Symbolic logic, 1990."}],"container-title":["Lecture Notes in Computer Science","ESOP '90"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52592-0_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:08:54Z","timestamp":1619572134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52592-0_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525929","9783540470458"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-52592-0_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}