{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:30:51Z","timestamp":1778301051765,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540603603","type":"print"},{"value":"9783540450504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60360-3_49","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:19:35Z","timestamp":1330280375000},"page":"348-365","source":"Crossref","is-referenced-by-count":3,"title":["Strictness analysis by abstract reduction using a tableau calculus"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Schmidt-Schau\u00df","sequence":"first","affiliation":[]},{"given":"Sven Eric","family":"Panitz","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Sch\u00fctz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Patrick Cousot and Radhia Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, pages 252\u2013252. ACM Press, 1977.","DOI":"10.1145\/512950.512973"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Denis B Howe and Geoffrey L Burn. Using strictness in the STG machine. In John T O'Donnel and Kevin Hammond, editors, Functional Programming, Workshops in Computingt, pages 127\u2013137. Springer, 1993.","DOI":"10.1007\/978-1-4471-3236-3_10"},{"key":"22_CR3","unstructured":"P. H. Hartel, M. Feeley, M. Alt, L. Augustsson, P. Baumann, M. Beemster, E. Chailloux, C. H. Flood, W. Grieskamp, J. H. G. van Groningen, K. Hammond, B. Hausman, M.Y. Ivory, P. Lee, X. Leroy, S: Loosemore, N. R\u00f6jemo, M. Serrano, J.-P. Talpin, J. Thackray, P. Weiss, and P. Wentworth. Pseudoknot: a float-intensive benchmark for functional compilers. In John Glauert, editor, Implementation of Functional Languages '94, 1994. Draft."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Kristian Damm Jensen, Peter Hj\u00e6resen, and Mads Rosendahl. Efficient strictness analysis of Haskell. In Baudouin Le Charlier, editor, Static Analysis, number 864 in Lecture Notes in Computer Science, pages 346\u2013362. Springer, 1994.","DOI":"10.1007\/3-540-58485-4_51"},{"key":"22_CR5","unstructured":"Mark P. Jones. The implementation of the Gofer functional programming system. Research Report YALEU\/DCS\/RR-1030, Yale University, Department of Computer Science, May 1994."},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Alan Mycroft. The theory and practice of transforming call-by-need into call-by-value. In 4th International Symposium on Programming, number 83 in Lecture Notes in Computer Science, pages 269\u2013281. Springer, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Eric N\u00f6cker. Strictness analysis by abstract reduction in orthogonal term rewriting systems. Technical Report 92-31, University of Nijmegen, Department of Computer Science, 1992.","DOI":"10.1145\/165180.165219"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Eric N\u00f6cker. Strictness analysis using abstract reduction. In Functional Programming Languages and Computer Architecture, pages 255\u2013265. ACM Press, 1993.","DOI":"10.1145\/165180.165219"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"E. G. J. M. H. N\u00f6cker, J. E. W. Smetsers, M. C. J. D. van Eekelen, and M. J. Plasmeijer. Concurrent Clean. In Springer Verlag, editor, Proc of Parallel Architecture and Languages Europe (PARLE'91), number 505 in Lecture Notes in Computer Science, pages 202\u2013219, 1991.","DOI":"10.1007\/3-540-54152-7_66"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Simon L. Peyton Jones and John Launchbury. Unboxed values as first class citizens in a non-strict functional language. In Functional Programming Languages and Computer Architecture, number 523 in Lecture Notes in Computer Science, pages 636\u2013666. Springer, 1991.","DOI":"10.1007\/3540543961_30"},{"key":"22_CR11","volume-title":"Implementing Functional Languages: a Tutorial","author":"Simon L. L. Peyto P. Jones","year":"1991","unstructured":"Simon L. Peyton Jones and David R. Lester. Implementing Functional Languages: a Tutorial. Prentice-Hall International, London, 1991."},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Simon L. Peyton Jones and Andr\u00e9 Santos. Compilation by transformation in the Glasgow Haskell Compiler. In Functional Programming, Glasgow 1994, Workshops in Computing, pages 184\u2013204. Springer, 1994.","DOI":"10.1007\/978-1-4471-3573-9_13"},{"key":"22_CR13","volume-title":"Functional Programming and Parallel Graph Rewriting","author":"R. Plasmeijer","year":"1993","unstructured":"Rinus Plasmeijer and Marko van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Workingham, 1993."},{"key":"22_CR14","volume-title":"Master's thesis","author":"M. Sch\u00fctz","year":"1994","unstructured":"Marko Sch\u00fctz. Striktheits-Analyse mittels abstrakter Reduktion f\u00fcr den Sprachkern einer nicht-strikten funktionalen Programmiersprache. Master's thesis, Johann Wolfgang Goethe-Universit\u00e4t, Frankfurt, 1994. in German."},{"key":"22_CR15","unstructured":"Marko Sch\u00fctz. The G#-machine: Efficient strictness analysis in Haskell. Technical Report 1\/95, Johann Wolfgang Goethe-Universit\u00e4t, Fachbereich Informatik, January 1995."},{"key":"22_CR16","unstructured":"Raymond M. Smullyan. First-Order Logic. Springer, 1971."},{"key":"22_CR17","volume-title":"Term Graph Rewriting-Theory and Practice","author":"M. Eekelen van","year":"1993","unstructured":"M. van Eekelen, E. Goubault, C.L. Hankin, and E. N\u00f6cker. Abstract reduction: Towards a theory via abstract interpretation. In M.R. Sleep, M.J. Plasmeijer, and M.C.J.D. van Eekelen, editors, Term Graph Rewriting-Theory and Practice, chapter 9. Wiley, Chichester, 1993."},{"key":"22_CR18","volume-title":"Abstract Interpretation of Declerative Languages","author":"P. Wadler","year":"1987","unstructured":"Phil Wadler. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In Samson Abramsky and Chris Hankin, editors, Abstract Interpretation of Declerative Languages, chapter 12. Ellis Horwood Limited, Chichester, 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_49.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:59:22Z","timestamp":1687287562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60360-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603603","9783540450504"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-60360-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}