{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T06:42:43Z","timestamp":1750488163187,"version":"3.33.0"},"reference-count":39,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2007,4]]},"DOI":"10.1051\/ita:2007010","type":"journal-article","created":{"date-parts":[[2007,7,17]],"date-time":"2007-07-17T11:44:40Z","timestamp":1184672680000},"page":"225-241","source":"Crossref","is-referenced-by-count":2,"title":["Deciding inclusion of set constants over infinite non-strict data structures"],"prefix":"10.1051","volume":"41","author":[{"given":"Manfred","family":"Schmidt-Schauss","sequence":"first","affiliation":[]},{"given":"David","family":"Sabel","sequence":"additional","affiliation":[]},{"given":"Marko","family":"Sch\u00fctz","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2007,7,18]]},"reference":[{"key":"R1","unstructured":"S. Abramsky and C. Hankin,Abstract interpretation of declarative languages. Ellis Horwood, (1987)."},{"key":"R2","first-page":"171","volume":"874","author":"Aiken","year":"1994","journal-title":"Lect. Notes Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"A. Aiken, D. Kozen, M.Y. Vardi and E.L. Wimmers, The complexity of set constraints, inProc. CSL 1993, Swansea, Wales (1993) 1\u201317.","DOI":"10.1007\/BFb0049320"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"Z.M. Ariola and S. Blom, Cyclic lambda calculi, inTACS, Sendai, Japan (1997) 77\u2013106.","DOI":"10.1007\/BFb0014548"},{"key":"R5","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1006\/inco.1997.2651","volume":"139","author":"Ariola","year":"1997","journal-title":"Inform. Comput."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"L. Bachmair, H. Ganzinger and U. Waldmann, Set constraints are the monadic class, inProc. 8th Proc Symp. Logic in Computer Science, Swansea, Wales (1993) 75\u201383.","DOI":"10.1109\/LICS.1993.287598"},{"key":"R7","unstructured":"G. Burn,Lazy Functional Languages: Abstract Interpretation and Compilation. Pitman, London, (1991)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-16446-4_3","volume":"217","author":"Burn","year":"1985","journal-title":"Lect. Notes Comput. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BFb0052372","volume":"1379","author":"Charatonik","year":"1998","journal-title":"Lect. Notes Comput. Sci."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"D. Clark, C. Hankin, and S. Hunt, Safety of strictness analysis via term graph rewriting. InSAS 2000(2000) 95\u2013114.","DOI":"10.1007\/978-3-540-45099-3_6"},{"key":"R11","unstructured":"H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata, 1997. release October, 1rst 2002."},{"key":"R12","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0304-3975(00)00348-0","volume":"272","author":"Coppo","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"R13","unstructured":"P. Cousot and R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, inConference Record of the Fourth ACM Symposium on Principles of Programming Languages, ACM Press (1977) 252\u2013252."},{"key":"R14","unstructured":"B.A. Davey and H.A. Priestley,Introduction to Lattices and Order. Cambridge University Press, Cambridge, (1992)."},{"key":"R15","unstructured":"P. Devienne, J.-M. Talbot and S. Tison, Co-definite set constraints with membership expressions, inJICSLP'98: Proceedings of the 1998 joint international conference and symposium on Logic programming, Cambridge, MA, USA, MIT Press (1998) 25\u201339."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"T.P. Jensen, inference of polymorphic and conditional strictness properties, inSymposium on Principles of Programming Languages, San Diego, ACM Press. (1998) 209\u2013221.","DOI":"10.1145\/268946.268964"},{"key":"R17","unstructured":"S.P. Jones,Haskell 98 Language and Libraries. Cambridge University Press (2003). www.haskell.org"},{"key":"R18","unstructured":"Tsun-Ming Kuo and P. Mishra, Strictness analysis: A new perspective based on type inference, inFunctional Programming Languages and Computer Architecture, ACM Press, (1989) 260\u2013272."},{"key":"R19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0167-6423(96)00043-3","volume":"31","author":"Lackner Solberg Gasser","year":"1998","journal-title":"Sci. Comput. Programming"},{"key":"R20","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01018827","volume":"8","author":"Launchbury","year":"1995","journal-title":"Lisp Symbolic Comput."},{"key":"R21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/3-540-46425-5_18","volume":"1782","author":"Mauborgne","year":"2000","journal-title":"Lect. Notes Comput. Sci."},{"key":"R22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0167-6423(02)00088-6","volume":"46","author":"Moran","year":"2003","journal-title":"Sci. Comput. Programming"},{"key":"R23","unstructured":"A. Mycroft,Abstract Interpretation and Optimising Transformations for Applicative Programs. Ph.D. thesis, University of Edinburgh (1981)."},{"key":"R24","unstructured":"E. N\u00f6cker,Strictness analysis using abstract reduction.Technical Report 90-14, Department of Computer Science, University of Nijmegen (1990)."},{"key":"R25","doi-asserted-by":"crossref","unstructured":"E. 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":"R26","doi-asserted-by":"crossref","unstructured":"E. N\u00f6cker, Strictness analysis using abstract reduction. InFunctional Programming Languages and Computer Architecture, ACM Press, (1993) 255\u2013265.","DOI":"10.1145\/165180.165219"},{"key":"R27","first-page":"155","volume":"1595","author":"Pape","year":"1998","journal-title":"Lect. Notes Comput. Sci."},{"key":"R28","unstructured":"D. Pape,Striktheitsanalysen funktionaler Sprachen. Ph.D. thesis, Fachbereich Mathematik und Informatik, Freie Universit\u00e4t Berlin, (2000). In German."},{"key":"R29","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/3-540-61739-6_46","volume":"1145","author":"Paterson","year":"1996","journal-title":"Lect. Notes Comput. Sci."},{"key":"R30","unstructured":"R. Plasmeijer and M. van Eekelen,The concurrent Clean language report: Version 1.3 and 2.0.Technical report, Dept. of Computer Science, University of Nijmegen, 2003. http:\/\/www.cs.kun.nl\/~clean\/"},{"key":"R31","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/978-3-540-30124-0_35","volume":"3210","author":"Rychlikowski","year":"2004","journal-title":"Lect. Notes Comput. Sci."},{"key":"R32","unstructured":"M. Schmidt-Schau\u00df, S. Eric Panitz and M. Sch\u00fctz, Strictness analysis by abstract reduction using a tableau calculus, inProc. of the Static Analysis Symposium.Lect. Notes Comput. Sci.983(1995) 348\u2013365."},{"key":"R33","unstructured":"M. Schmidt-Schau\u00df, M. Sch\u00fctz and D. Sabel,On the safety of N\u00f6cker's strictness analysis. Technical Report Frank-19, Institut f\u00fcr Informatik. J.W. Goethe-University (2004)."},{"key":"R34","unstructured":"M. Schmidt-Schau\u00df, M. Sch\u00fctz and D. Sabel,A complete proof of the safety of N\u00f6cker's strictness analysis.Technical Report Frank-20, Institut f\u00fcr Informatik. J.W. Goethe-University, (2005)."},{"key":"R35","unstructured":"M. Sch\u00fctz,Analysing demand in nonstrict functional programming languages. Dissertation, J.W.Goethe-Universit\u00e4t Frankfurt, 2000. Available at http:\/\/www.ki.informatik.uni-frankfurt.de\/papers\/marko"},{"key":"R36","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"Seidl","year":"1990","journal-title":"SIAM J. Comput."},{"key":"R37","doi-asserted-by":"crossref","unstructured":"W. Thomas, Automata on infinite objects. InHandbook of Theoretical Computer Science, Formal Models and Semantics (B), edited by J. van Leeuwen, Elsevier (1990) 133\u2013192.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"R38","unstructured":"P. Wadler, Strictness analysis on non-flat domains (by abstract interpretation over finite domains). InAbstract Interpretation of Declarative Languages, Chap. 12. Edited by S. Abramsky and C. Hankin, Ellis Horwood Limited, Chichester (1987)."},{"key":"R39","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-18317-5_21","volume":"274","author":"Wadler","year":"1987","journal-title":"Lect. Notes Comput. Sci."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2007010\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T15:07:34Z","timestamp":1737299254000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2007010"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":39,"journal-issue":{"issue":"2"},"alternative-id":["ita05014"],"URL":"https:\/\/doi.org\/10.1051\/ita:2007010","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2007,4]]}}}