{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T10:35:56Z","timestamp":1770287756451,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540183174","type":"print"},{"value":"9783540478799","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-18317-5_21","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:32:19Z","timestamp":1330198339000},"page":"385-407","source":"Crossref","is-referenced-by-count":70,"title":["Projections for strictness analysis"],"prefix":"10.1007","author":[{"given":"Philip","family":"Wadler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. J. M.","family":"Hughes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"21_CR1","volume-title":"Workshop on Programs as Data Objects","author":"S. Abramsky","year":"1985","unstructured":"S. Abramsky. Strictness analysis and polymorphic invariance. In N. Jones and H. Ganzinger, editors, Workshop on Programs as Data Objects, Springer-Verlag, Copenhagen, October 1985. LNCS 217."},{"key":"21_CR2","unstructured":"S. Abramsky and C. Hankin. Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"L. Augustsson. A compiler for lazy ML. In ACM Symposium on Lisp and Functional Programming, pages 218\u2013227, Austin, 1984.","DOI":"10.1145\/800055.802038"},{"key":"21_CR4","series-title":"LNCS","volume-title":"Workshop on Programs as Data Objects","author":"G. L. Burn","year":"1985","unstructured":"G.L. Burn, C.L. Hankin, and S. Abramsky. The theory of strictness analysis for higherorder functions. In N. Jones and H. Ganzinger, editors, Workshop on Programs as Data Objects, Springer-Verlag, Copenhagen, October 1985. LNCS 217."},{"key":"21_CR5","volume-title":"Complexity analysis of Programs in type theory","author":"B. Bjerner","year":"1987","unstructured":"B. Bjerner. Complexity analysis of Programs in type theory. Programming Methodology Group, Chalmers University of Technology, G\u00f6teborg, Sweden, 1987."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"G. L. Burn. Evaluation transformers\u2014a model for the parallel evaluation of functional languages. In Conference on Functional Programming Languages and Computer Architecture, Portland, Oregon, September 1987.","DOI":"10.1007\/3-540-18317-5_24"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"C. Clack and S. L. Peyton-Jones. Strictness analysis\u2014a practical approach. In Conference on Functional Programming Languages and Computer Architecture, Nancy, France, 1985.","DOI":"10.1007\/3-540-15975-4_28"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"P. Dybjer. Computing inverse images. In International Conference on Automata, Languages, and Programming, 1987.","DOI":"10.1007\/3-540-18088-5_3"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"J. Fairbairn and S. C. Wray. Code generation techniques for functional languages. In ACM Symposium on Lisp and Functional Programming, pages 94\u2013104, Boston, 1986.","DOI":"10.1145\/319838.319853"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"P. Hudak and A. Bloss. The aggregate update problem in functional programming systems. In 12'th ACM Symposium on Principles of Programming Languages, pages 300\u2013314, January 1985.","DOI":"10.1145\/318593.318660"},{"key":"21_CR11","series-title":"Technical Report","volume-title":"Why functional programming matters","author":"R. J. M. M. Hughes","year":"1984","unstructured":"R. J. M. Hughes. Why functional programming matters. Technical Report, Programming Methodology Group, Chalmers University of Technology, G\u00f6teborg, Sweden, 1984."},{"key":"21_CR12","series-title":"LNCS","volume-title":"Workshop on Programs as Data Objects","author":"R. J. M. M. Hughes","year":"1985","unstructured":"R. J. M. Hughes. Strictness detection in non-flat domains. In N. Jones and H. Ganzinger, editors, Workshop on Programs as Data Objects, Springer-Verlag, Copenhagen, October 1985. LNCS 217."},{"key":"21_CR13","unstructured":"R. J. M. Hughes. Analysing strictness by abstract interpretation of continuations. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987, to appear."},{"key":"21_CR14","unstructured":"R. J. M. Hughes. Backwards analysis of functional programs. University of Glasgow research report CSC\/87\/R3, March 1987."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"C. V. Hall and D. S. Wise. Compiling strictness into streams. In 14'th ACM Symposium on Principles of Programming Languages, pages 132\u2013143, Munich, January 1987.","DOI":"10.1145\/41625.41637"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young. Higher order strictness analysis in untyped lambda calculus. In 12'th ACM Symposium on Principles of Programming Languages, pages 97\u2013109, January 1985.","DOI":"10.1145\/512644.512653"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"T. Johnsson. Efficient compilation of lazy evaluation. In ACM Symposium on Compiler Construction, 1984.","DOI":"10.1145\/502874.502880"},{"key":"21_CR18","volume-title":"Attribute grammars as a paradigm for functional programming","author":"T. Johnsson","year":"1987","unstructured":"T. Johnsson. Attribute grammars as a paradigm for functional programming. Programming Methodology Group, Chalmers University of Technology, G\u00f6teborg, Sweden, 1987."},{"key":"21_CR19","unstructured":"A. Mycroft. Abstract interpretation and optimising transformations for applicative programs. PhD thesis, University of Edinburgh, 1981."},{"key":"21_CR20","unstructured":"S. L. Peyton-Jones and C. Clack. Finding fixpoints in abstract interpretation. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987."},{"key":"21_CR21","unstructured":"S. L. Peyton-Jones. Implementing Functional Languages using Graph Reduction. Prentice-Hall, 1987."},{"key":"21_CR22","volume-title":"Denotational Semantics: A Methodology for Language Development","author":"D. A. Schmidt","year":"1986","unstructured":"D. A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Newton, Massachusetts, 1986."},{"key":"21_CR23","unstructured":"D. S. Scott. Lectures on a mathematical theory of computation. Technical Report PRG-19, Oxford University Programming Research Group, May 1981."},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"D. S. Scott. Domains for denotational semantics. In Conference on Automata, Languages and Programming, pages 577\u2013613, Springer-Verlag, July 1982. LNCS 140.","DOI":"10.1007\/BFb0012801"},{"key":"21_CR25","volume-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"J. E. Stoy","year":"1977","unstructured":"J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, Cambridge, Massachusetts, 1977."},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"P. L. Wadler. How to replace failure by a list of successes. In Conference on Functional Programming Languages and Computer Architecture, Nancy, France, 1985.","DOI":"10.1007\/3-540-15975-4_33"},{"key":"21_CR27","volume-title":"Workshop on Programs as Data Objects","author":"P. L. Wadler","year":"1985","unstructured":"P. L. Wadler. Listlessness is better than laziness II: composing listless functions. In N. Jones and H. Ganzinger, editors, Workshop on Programs as Data Objects, Springer-Verlag, Copenhagen, October 1985, LNCS 217."},{"key":"21_CR28","unstructured":"P. L. Wadler. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987, to appear."},{"key":"21_CR29","unstructured":"S. C. Wray. Implementation and Programming Techniques for Functional Languages. PhD thesis, University of Cambridge, January 1986."},{"key":"21_CR30","unstructured":"J. Young and P. Hudak. Finding fixpoints on function spaces. Technical Report YALEU\/DCS\/RR-505, Yale University Dept. of Computer Science, December 1986."}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18317-5_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:07:37Z","timestamp":1640916457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18317-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540183174","9783540478799"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-18317-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987]]}}}