{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:31Z","timestamp":1725663451281},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549673"},{"type":"electronic","value":"9783540466123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54967-6_59","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:21:53Z","timestamp":1330212113000},"page":"25-39","source":"Crossref","is-referenced-by-count":2,"title":["Time analysis, cost equivalence and program refinement"],"prefix":"10.1007","author":[{"given":"David","family":"Sands","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola and Arvind. A syntactic approach to program transformation. In Proceedings of the symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM press, SIGPLAN notices, 26(9), September 1991.","DOI":"10.1145\/115865.115878"},{"key":"3_CR2","unstructured":"S. Abramsky. The lazy lambda calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison Wesley, 1990."},{"key":"3_CR3","series-title":"The Addison-Wesley Series in Computer Science and Information Processing","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. The Addison-Wesley Series in Computer Science and Information Processing. Addison-Wesley Publishing Company, London, 1974."},{"key":"3_CR4","unstructured":"H.P. Barendregt. The Lambda Calculus, volume 103 of Studies in Logic and the Foundations of Mathematics. Elsevier Science Publishers B.V., 2nd edition, 1984."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"B. Bjerner and S. Holmstr\u00f6m. A compositional approach to time analysis of first order lazy functional programs. In Functional Programming Languages and Computer Architecture, conference proceedings. ACM press, 1989.","DOI":"10.1145\/99370.99382"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G.L. Burn","year":"1986","unstructured":"G.L. Burn, C.L. Hankin, and S. Abramsky. The theory and practice of strictness analysis for higher order functions. Science of Computer Programming, 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"3_CR7","unstructured":"B. Bjerner. Time Complexity of Programs in Type Theory. PhD thesis, Chalmers University of Technology, 1989."},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"G. L. Burn. The evaluation transformer model of reduction and its correctness. In TAPSOFT '91 (also Imperial College report DOC 90\/19), 1991.","DOI":"10.1007\/3540539816_81"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph rewriting. In PARLE '87 volume II, number 259 in LNCS, pages 191\u2013231. Springer Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"3_CR10","unstructured":"R. L. Graham, D. E. Knuth, and O. Patashnik. Concrete Mathematics. Addison-Wesley, 1989."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/42267.42275","volume":"35","author":"T. Hickey","year":"1988","unstructured":"T. Hickey and J. Cohen. Automating program analysis. J. ACM, 35:185\u2013220, January 1988.","journal-title":"J. ACM"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"D. J. Howe. Equality in lazy computation systems. In Fourth annual symposium on Logic In Computer Science. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39174"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/42190.42347","volume":"10","author":"D. LeM\u00e9tayer","year":"1988","unstructured":"D. LeM\u00e9tayer. An automatic complexity evaluator. ACM ToPLaS, 10(2):248\u2013266, April 1988.","journal-title":"ACM ToPLaS"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR15","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I. Mason","year":"1991","unstructured":"I. Mason and C. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1(3):287\u2013327, July 1991.","journal-title":"Journal of Functional Programming"},{"key":"3_CR16","unstructured":"D. Park. Concurrency and automata on infinite sequences. In 5th GI conference on Theoretical Computer Science. LNCS 104, Springer Verlag, 1980."},{"key":"3_CR17","series-title":"Prentice-Hall International Series in Computer Science","volume-title":"The Implementation of Functional Programming Languages","author":"S. L. P. Jones","year":"1987","unstructured":"S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall International Series in Computer Science. Prentice-Hall International (UK) Ltd, London, 1987."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"M. Rosendahl. Automatic complexity analysis. In Functional Programming Languages and computer architecture, conference proceedings. ACM press, 1989.","DOI":"10.1145\/99370.99381"},{"key":"3_CR19","unstructured":"D. Sands. Complexity analysis for a higher order language. Technical Report DOC 88\/14, Imperial College, October 1988."},{"key":"3_CR20","unstructured":"D. Sands. Calculi for Time Analysis of Functional Programs. PhD thesis, Imperial College, September 1990."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"D. Sands. Complexity analysis for a lazy higher-order language. In Proceedings of the Third European Symposium on Programming, number 432 in LNCS. Springer-Verlag, May 1990.","DOI":"10.1007\/978-1-4471-3166-3_5"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"D. Sands. Time analysis, cost equivalence and program refinement. Technical report, Imperial College, 1991.","DOI":"10.1007\/3-540-54967-6_59"},{"key":"3_CR23","unstructured":"D. Sands. Towards semantic notions of program improvement. In Proceedings of the Fourth Glasgow Workshop on Functional Programming, Skye, 1991. To appear: Springer Workshop Series."},{"key":"3_CR24","unstructured":"C. L. Talcott. The Essence of Rum, A Theory of the intensional and extensional aspects of Lisp-type computation. PhD thesis, Stanford University, August 1985."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Math., 5, 1955.","DOI":"10.2140\/pjm.1955.5.285"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"P. Wadler. Strictness analysis aids time analysis. In 15th ACM Symposium on Principals of Programming Languages, January 1988.","DOI":"10.1145\/73560.73571"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1145\/361002.361016","volume":"18","author":"B. Wegbreit","year":"1975","unstructured":"B. Wegbreit. Mechanical program analysis. C.ACM, 18:528\u2013539, September 1975.","journal-title":"C.ACM"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"P. Wadler and R. J. M. Hughes. Projections for strictness analysis. In 1987 Conference on Functional Programming and Computer Architecture, Portland, Oregon, September 1987.","DOI":"10.1007\/3-540-18317-5_21"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54967-6_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:58Z","timestamp":1605646618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54967-6_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549673","9783540466123"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-54967-6_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}