{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:02:24Z","timestamp":1773478944931,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003267","type":"print"},{"value":"9783540363774","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36377-7_4","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T23:03:07Z","timestamp":1181170987000},"page":"60-82","source":"Crossref","is-referenced-by-count":17,"title":["Lambda Calculi and Linear Speedups"],"prefix":"10.1007","author":[{"given":"David","family":"Sands","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rgen","family":"Gustavsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BFb0014548","volume-title":"Proc. TACS\u201997","author":"Z. M. Ariola","year":"1997","unstructured":"Z. M. Ariola and S. Blom, Cyclic lambda calculi, Proc. TACS\u201997, LNCS, vol. 1281, Springer-Verlag, February 1997, pp. 77\u2013106."},{"key":"4_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8598-9","volume-title":"A theory of objects","author":"M. Abadi","year":"1996","unstructured":"M. Abadi and L. Cardelli, A theory of objects, Springer-Verlag, New York, 1996."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Z. Ariola, M. Felleisen, J. Maraist, M. Odersky, and P. Wadler, A call-byneed lambda calculus, Proc. POPL\u201995, the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, January 1995, pp. 233\u2013246.","DOI":"10.1145\/199448.199507"},{"key":"4_CR4","unstructured":"Lars Andersen and Carsten Gomard, Speedup analysis in partial evaluation: Preliminary results, Proceedings of the 1992 ACM Workshop on Partial Evaluation and Semantics-Based Program Manipulation (San Francisco, U.S.A.), Association for Computing Machinery, June 1992, pp. 1\u20137."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(83)90142-1","volume":"22","author":"G. Boudol","year":"1983","unstructured":"Gerard Boudol and Laurent Kott, Recursion induction principle revisited, Theoretical Computer Science 22 (1983), 135\u2013173.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90014-7","volume":"103","author":"M. Felleisen","year":"1992","unstructured":"Matthias Felleisen and Robert Hieb, A revised report on the syntactic theories of sequential control and state, Theoretical Computer Science 103 (1992), no. 2, 235\u2013271.","journal-title":"Theoretical Computer Science"},{"key":"4_CR7","unstructured":"Neil D. Jones, Carsten K. Gomard, and Peter Sestoft, Partial evaluation and automatic program generation, Prentice Hall International, International Series in Computer Science, June 1993, ISBN number 0-13-020249-5 (pbk)."},{"key":"4_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/BFb0032064","volume-title":"Automata, Languages and Programming","author":"N. D. Jones","year":"1990","unstructured":"Neil D. Jones, Partial evaluation, self-application and types, Automata, Languages and Programming, LNCS, vol. 443, Springer-Verlag, 1990, pp. 639\u2013659."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"N. D. Jones, Constant time factors do matter, STOC\u2019 93. Symposium on Theory of Computing (Steven Homer, ed.), ACM Press, 1993, pp. 602\u2013611.","DOI":"10.1145\/167088.167244"},{"key":"4_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-61580-6_11","volume-title":"Partial Evaluation","author":"N. D. Jones","year":"1996","unstructured":"Neil D. Jones, What not to do when writing an interpreter for specialisation, Partial Evaluation (Olivier Danvy, Robert Gl\u00fcck, and Peter Thiemann, eds.), Lecture Notes in Computer Science, vol. 1110, Springer-Verlag, 1996, pp. 216\u2013237."},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P. J. Landin","year":"1966","unstructured":"P. J. Landin, The next 700 programming languages, Communications of the ACM 9 (1966), no. 3, 157\u2013164.","journal-title":"Communications of the ACM"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner, Fully abstract models of the typed \u00eb-calculus, Theoretical Computer Science 4 (1977), 1\u201322.","journal-title":"Theoretical Computer Science"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Andrew Moran and David Sands, Improvement in a lazy context: An operational theory for call-by-need, Proc. POPL\u201999, ACM Press, January 1999, pp. 43\u201356.","DOI":"10.1145\/292540.292547"},{"issue":"1","key":"4_CR14","first-page":"125","volume":"1","author":"G. Plotkin","year":"1976","unstructured":"G. Plotkin, Call-by-name, call-by-value and the \u00eb-calculus, Theoretical Computer Science 1 (1976), no. 1, 125\u2013159.","journal-title":"Theoretical Computer Science"},{"issue":"1\u20133","key":"4_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0167-6423(97)00032-4","volume":"32","author":"E. Rose","year":"1998","unstructured":"Eva Rose, Linear-time hierarchies for a functional language machine model, Science of Computer Programming 32 (1998), no. 1\u20133, 109\u2013143, 6th European Symposium on Programming (Link\u00f6ping, 1996).","journal-title":"Science of Computer Programming"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"D. Sands, Proving the correctness of recursion-based automatic program transformations, Theoretical Computer Science 167 (1996), no. A.","DOI":"10.1016\/0304-3975(96)00074-6"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1017\/S0956796800000964","volume":"4","author":"H. Zhu","year":"1994","unstructured":"Hong Zhu, How powerful are folding\/unfolding transformations?, Journal of Functional Programming 4 (1994), no. 1, 89\u2013112.","journal-title":"Journal of Functional Programming"}],"container-title":["Lecture Notes in Computer Science","The Essence of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36377-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:36:53Z","timestamp":1556480213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36377-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003267","9783540363774"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36377-7_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}