{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:16Z","timestamp":1742600416000,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603603"},{"type":"electronic","value":"9783540450504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60360-3_51","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:20:13Z","timestamp":1330280413000},"page":"382-399","source":"Crossref","is-referenced-by-count":1,"title":["Beyond prototype implementations: Polymorphic projection analysis for Glasgow Haskell"],"prefix":"10.1007","author":[{"given":"Julian","family":"Seward","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"24_CR1","volume-title":"A call-by-need lambda calculus","author":"Z. Ariola","year":"1995","unstructured":"Zena Ariola, Matthias Felleisen, John Maraist, Martin Odersky, and Philip Wadler. A call-by-need lambda calculus. In 22nd Symposium on Principles of Programming Languages, San Francisco, California, January 1995. ACM Press."},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Lennart Augustsson. Implementing haskell overloading. In Proceedings of the Functional Programming Languages and Computer Architecture Conference, Copenhagen, Denmark, June 1993.","DOI":"10.1145\/165180.165191"},{"key":"24_CR3","volume-title":"PhD thesis","author":"G. Baraki","year":"1993","unstructured":"Gebreselassie Baraki. Abstract Interpretation of Polymorphic Higher-Order Functions. PhD thesis, Department of Computer Science, University of Glasgow, Lilybank Gardens, Glasgow G12 8QQ, UK, February 1993. Also available as a Glasgow Tech Report FP-93-07."},{"key":"24_CR4","series-title":"Springer-Verlag LNCS 217","first-page":"42","volume-title":"The theory of strictness analysis for higher-order functions","author":"G. L. Burn","year":"1985","unstructured":"G.L. Burn, C.L. Hankin, and S. Abramsky. The theory of strictness analysis for higher-order functions. In Proceedings of the Workshop on Programs as Data Objects, pages 42\u201362, DIKU, Copenhagen, Denmark, 17\u201319 October 1985. Springer-Verlag LNCS 217."},{"key":"24_CR5","unstructured":"Cousot and Cousot. Static determination of dynamic properties of recursive procedures. In E.J. Neuhold, editor, Formal Description of Programming Concepts. North-Holland, 1978."},{"key":"24_CR6","unstructured":"Charles Consel. Fast strictness analysis via symbolic fixpoint iteration. Unpublished. Yale University, Department of Computer Science, September 1991."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Alex Ferguson and John Hughes. Fast abstract interpretation using sequential algorithms. In Proceedings of the Chalmers Programming Methodology Group Winter Meeting, January 1993. Department of Computer Sciences, Chalmers University of Technology.","DOI":"10.1007\/3-540-57264-3_28"},{"key":"24_CR8","volume-title":"Workshops in Computing","author":"Cordelia V. V. Hall","year":"1993","unstructured":"Cordelia V. Hall. Using strictness analysis in practice for data structures. In John T. O'Donnell and Kevin Hammond, editors, Glasgow Workshop on Functional Programming, Workshops in Computing, Ayr, Scotland, July 1993. Springer-Verlag."},{"issue":"1","key":"24_CR9","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1017\/S0956796800000071","volume":"1","author":"S. Hunt","year":"1991","unstructured":"Sebastian Hunt and Chris Hankin. Fixed points and frontiers: a new perspective. Journal of Functional Programming, 1(1):91\u2013120, January 1991.","journal-title":"Journal of Functional Programming"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Pieter H. Hartel and Koen G. Langendoen. Benchmarking implementations of lazy functional languages. Technical report, Department of Computer Systems, Faculty of Mathematics and Computer Science, University of Amsterdam, December 1992.","DOI":"10.1145\/165180.165230"},{"key":"24_CR11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1017\/S0960129500001493","volume":"2","author":"J. Hughes","year":"1992","unstructured":"John Hughes and John Launchbury. Projections for polymorphic first-order strictness analysis. In Mathematical Structures in Computer Science, volume 2, pages 301\u2013326, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"C. L. Hankin and D. Le M\u00e9tayer. Deriving algorithms from type inference systems: Application to strictness analysis. In Proceedings of POPL'94, 1994.","DOI":"10.1145\/174675.177858"},{"key":"24_CR13","unstructured":"John Hughes. Compile-time analysis of functional programs. In David A. Turner, editor, Research Topics in Functional Programming. Addison-Wesley Publishing Company, 1990. From the 1987 Year of Programming, University of Texas, Austin, Texas."},{"key":"24_CR14","unstructured":"Sebastian Hunt. Abstract Interpretation of Functional Languages: From Theory to Practice. PhD thesis, Imperial College, University of London, 1991."},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Neil D. Jones and Alan Mycroft. Data flow analysis of applicative programs using minimal function graphs: Abridged version. In Thirteenth ACM Symposium on Principles of Programming Languages, St. Petersburg, Florida, pages 296\u2013306, 1986.","DOI":"10.1145\/512644.512672"},{"key":"24_CR16","unstructured":"Mark P. Jones. Partial evaluation for dictionary-free overloading. Technical Report RR-959, Department of Computer Science, Yale University, April 1993."},{"key":"24_CR17","unstructured":"R. Kubiak, J. Hughes, and J. Launchbury. A prototype implementation of projection-based first-order polymorphic strictness analysis. In R. Heldal, editor, Draft Proceedings of Fourth Annual Glasgow Workshop on Functional Programming, pages 322\u2013343, Skye, August 13\u201315 1991."},{"key":"24_CR18","unstructured":"Christopher Charles Martin. Algorithms for Finding Fixpoints in Abstract Interpretation. PhD thesis, Imperial College, University of London, June 1992."},{"key":"24_CR19","unstructured":"George C. Nelan. Firstification. PhD thesis, Arizona State University, 1991."},{"key":"24_CR20","volume-title":"Technical report","author":"F. Nielson","year":"1992","unstructured":"F. Nielson and H.R. Nielson. Finiteness conditions for fixed point iteration. Technical report, Computer Science Department, Aarhus University, Denmark, February 1992."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Eric Nocker. Strictness analysis using abstract reduction. In Proceedings of FPCA93, Copenhagen, Denmark, June 1993.","DOI":"10.1145\/165180.165219"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Will Partain. The nof ib benchmark suite of haskell programs. In Fifth Annual Glasgow Workshop on Functional Programming, Ayr, 1992.","DOI":"10.1007\/978-1-4471-3215-8_17"},{"key":"24_CR23","unstructured":"Simon Peyton Jones and Chris Clack. Finding fixpoints in abstract interpretation. In S. Abramsky and C.L. Hankin, editors, Abstract Interpretation of Declarative Languages, Computers and Their Applications, chapter 11, pages 246\u2013265. Ellis Horwood, 1987."},{"key":"24_CR24","volume-title":"Workshops in Computing","author":"W. Partain","year":"1993","unstructured":"Will Partain and Simon L. Peyton Jones. Measuring the effectiveness of a simple strictness analyser. In John T. O'Donnell and Kevin Hammond, editors, Glasgow Workshop on Functional Programming, Workshops in Computing, Ayr, Scotland, July 1993. Springer-Verlag."},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"Mads Rosendahl. Higher-order chaotic iteration sequences. In PLILP'93, pages 332\u2013345, Tallinn, Estonia, 1993. Springer-Verlag LNCS714.","DOI":"10.1007\/3-540-57186-8_89"},{"key":"24_CR26","unstructured":"Julian Seward. Towards a strictness analyser for haskell: Putting theory into practice. Master's thesis, University of Manchester, Department of Computer Science, 1991. Available as University of Manchester Technical Report UMCS-92-2-2."},{"key":"24_CR27","volume-title":"PhD thesis","author":"J. Seward","year":"1994","unstructured":"Julian Seward. Abstract Interpretation: A Quantitative Assessment. PhD thesis, Department of Computer Science, University of Manchester, Oxford Road, Manchester M13 9PL, UK, October 1994."},{"key":"24_CR28","first-page":"266","volume-title":"Abstract Interpretation of Declarative Languages","author":"P. L. Wadler","year":"1987","unstructured":"P.L. Wadler. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In S. Abramsky and C.L. Hankin, editors, Abstract Interpretation of Declarative Languages, chapter 12, pages 266\u2013275. Ellis Horwood Ltd., Chichester, West Sussex, England, 1987."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60360-3_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:01:12Z","timestamp":1742598072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60360-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603603","9783540450504"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-60360-3_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}