{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T20:13:17Z","timestamp":1673122397982},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"5","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[1997,9]]},"abstract":"We describe how binding-time, data-flow, and strictness analyses for languages with higher-order functions and algebraic data types can be obtained by instantiating a generic program logic and axiomatization of the properties analyzed for. A distinctive feature of the analyses is that disjunctions of program properties are represented exactly. This yields analyses of high precision and provides a logical characterization of abstract interpretations involving tensor products and uniform properties of recursive data structures. An effective method for proving properties of a program based on fixed-point iteration is obtained by grouping logically equivalent formulae of the same type into equivalence classes, obtaining a lattice of properties of that type, and then defining an abstract interpretation over these lattices. We demonstrate this in the case of strictness analysis by proving that the strictness abstract interpretation of a program is the equivalence class containing the strongest property provable of the program in the strictness logic.<\/jats:p>","DOI":"10.1145\/265943.265966","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T13:52:47Z","timestamp":1033998767000},"page":"751-803","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Disjunctive program analysis for algebraic data types"],"prefix":"10.1145","volume":"19","author":[{"given":"Thomas","family":"Jensen","sequence":"first","affiliation":[{"name":"IRISA\/CNRS, Rennes, France"}]}],"member":"320","published-online":{"date-parts":[[1997,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1991.9999"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","article-title":"Domain theory in logical form","volume":"51","author":"ABRAMSKY S.","year":"1991","unstructured":"ABRAMSKY , S. 1991 b. Domain theory in logical form . Ann. Pure Appl. Logic 51 , 1 - 77 . ABRAMSKY, S. 1991b. Domain theory in logical form. Ann. Pure Appl. Logic 51, 1-77.","journal-title":"Ann. Pure Appl. Logic"},{"key":"e_1_2_1_3_1","first-page":"163","volume-title":"Proceedings of the 21st Annual A CM Symposium on Principles of Programming Languages. ACM Press","author":"AIKEN","year":"1994","unstructured":"AIKEN , t., WIMMERS , E. L. , AND LAKSHMAN , T. I~ . 1994 . Soft typing with conditional types . In Proceedings of the 21st Annual A CM Symposium on Principles of Programming Languages. ACM Press , New York , 163 - 173 . 10.1145\/174675.177847 AIKEN, t., WIMMERS, E. L., AND LAKSHMAN, T. I~. 1994. Soft typing with conditional types. In Proceedings of the 21st Annual A CM Symposium on Principles of Programming Languages. ACM Press, New York, 163-173. 10.1145\/174675.177847"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01182783","article-title":"The tensor product of continuous lattices","volume":"172","author":"BANDELT H.-J.","year":"1980","unstructured":"BANDELT , H.-J. 1980 . The tensor product of continuous lattices . Mathematische Zeitschrift 172 , 89 - 96 . BANDELT, H.-J. 1980. The tensor product of continuous lattices. Mathematische Zeitschrift 172, 89-96.","journal-title":"Mathematische Zeitschrift"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1086"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the 2nd International Symposium on Logical Foundations of Computer Science, A. Nerode and M. Taitslin, Eds. Lecture Notes in Computer Science","volume":"620","author":"BENTON P. N.","year":"1992","unstructured":"BENTON , P. N. 1992 b. Strictness logic and polymorphic invariance . In Proceedings of the 2nd International Symposium on Logical Foundations of Computer Science, A. Nerode and M. Taitslin, Eds. Lecture Notes in Computer Science , vol. 620 . Springer Verlag, Berlin. BENTON, P. N. 1992b. Strictness logic and polymorphic invariance. In Proceedings of the 2nd International Symposium on Logical Foundations of Computer Science, A. Nerode and M. Taitslin, Eds. Lecture Notes in Computer Science, vol. 620. Springer Verlag, Berlin."},{"key":"e_1_2_1_8_1","series-title":"Lecture Notes in Computer Science","volume-title":"Static Analysis, P. C. et. al., Ed","author":"BENTON P. N.","unstructured":"BENTON , P. N. 1993. Strictness properties of lazy algebraic datatypes . In Static Analysis, P. C. et. al., Ed . Lecture Notes in Computer Science , vol. 724 . Springer Verlag , Berlin . BENTON, P. N. 1993. Strictness properties of lazy algebraic datatypes. In Static Analysis, P. C. et. al., Ed. Lecture Notes in Computer Science, vol. 724. Springer Verlag, Berlin."},{"key":"e_1_2_1_9_1","volume-title":"Lazy Functional Languages: Abstract Interpretation and Compilation. Research Monographs in Parallel and Distributed Computing","author":"BURN G. L.","unstructured":"BURN , G. L. 1991. Lazy Functional Languages: Abstract Interpretation and Compilation. Research Monographs in Parallel and Distributed Computing . Pitman , London, U.K. BURN, G. L. 1991. Lazy Functional Languages: Abstract Interpretation and Compilation. Research Monographs in Parallel and Distributed Computing. Pitman, London, U.K."},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"The theory and practice of strictness analysis for higher order functions. Sci","volume":"7","author":"BURN G. L.","year":"1986","unstructured":"BURN , G. L. , HANKIN , C. , AND ABRAMSKY , S. 1986 . The theory and practice of strictness analysis for higher order functions. Sci . Comput. Program. 7 , 249 - 278 . BURN, G. L., HANKIN, C., AND ABRAMSKY, S. 1986. The theory and practice of strictness analysis for higher order functions. Sci. Comput. Program. 7, 249-278.","journal-title":"Comput. Program."},{"key":"e_1_2_1_12_1","first-page":"106","volume-title":"Proceedings of the 2nd International Symposium on Programming. Dunod","author":"COUSOT P.","year":"1976","unstructured":"COUSOT , P. AND COUSOT , R. 1976 . Static determination of dynamic properties of programs . In Proceedings of the 2nd International Symposium on Programming. Dunod , Paris, France , 106 - 130 . COUSOT, P. AND COUSOT, R. 1976. Static determination of dynamic properties of programs. In Proceedings of the 2nd International Symposium on Programming. Dunod, Paris, France, 106-130."},{"key":"e_1_2_1_13_1","first-page":"269","volume-title":"Proceedings of the 6th A CM Symposium on Principles of Programming Languages. ACM Press","author":"COUSOT P.","year":"1979","unstructured":"COUSOT , P. AND COUSOT , R. 1979 . Systematic design of program analysis frameworks . In Proceedings of the 6th A CM Symposium on Principles of Programming Languages. ACM Press , New York , 269 - 282 . 10.1145\/567752.567778 COUSOT, P. AND COUSOT, R. 1979. Systematic design of program analysis frameworks. In Proceedings of the 6th A CM Symposium on Principles of Programming Languages. ACM Press, New York, 269-282. 10.1145\/567752.567778"},{"key":"e_1_2_1_15_1","first-page":"95","volume-title":"Proceedings of the 5th IEEE International Conference on Computer Languages, H. Bal, Ed. IEEE Press","author":"COUSOT P.","year":"1994","unstructured":"COUSOT , P. AND COUSOT , R. 1994 . Higher-order abstract interpretation (and application to comportment analysis generalising strictness, termination, projection and PER analysis of functional languages) . In Proceedings of the 5th IEEE International Conference on Computer Languages, H. Bal, Ed. IEEE Press , New York , 95 - 112 . COUSOT, P. AND COUSOT, R. 1994. Higher-order abstract interpretation (and application to comportment analysis generalising strictness, termination, projection and PER analysis of functional languages). In Proceedings of the 5th IEEE International Conference on Computer Languages, H. Bal, Ed. IEEE Press, New York, 95-112."},{"key":"e_1_2_1_16_1","volume-title":"Introduction to Lattices and Order","author":"DAVEY B.","unstructured":"DAVEY , B. AND PRIESTLEY , H. 1990. Introduction to Lattices and Order . Cambridge University Press , Cambridge, U.K. DAVEY, B. AND PRIESTLEY, H. 1990. Introduction to Lattices and Order. Cambridge University Press, Cambridge, U.K."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90028-E"},{"key":"e_1_2_1_18_1","volume-title":"t","author":"DEUTSCH","year":"1992","unstructured":"DEUTSCH , t . 1992 . Operational models of programming languages and representations of relations on regular languages with application to the static determination of dynamic aliasing properties of data. Ph.D. thesis, Univ. Paris VI , Paris, France. DEUTSCH, t. 1992. Operational models of programming languages and representations of relations on regular languages with application to the static determination of dynamic aliasing properties of data. Ph.D. thesis, Univ. Paris VI, Paris, France."},{"key":"e_1_2_1_19_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 18th International Colloqium on Automata, Languages and Programming","author":"ERNOULT C.","unstructured":"ERNOULT , C. AND MYCROFT , A. 1991. Uniform ideals and strictness analysis . In Proceedings of the 18th International Colloqium on Automata, Languages and Programming . Lecture Notes in Computer Science , vol. 510 . Springer Verlag , Berlin , 47-59. ERNOULT, C. AND MYCROFT, A. 1991. Uniform ideals and strictness analysis. In Proceedings of the 18th International Colloqium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 510. Springer Verlag, Berlin, 47-59."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 1989 Glasgow workshop, K. Davis and J. Hughes, Eds. Springer Verlag","author":"FERGUSON GHES","year":"1989","unstructured":"FERGUSON , t. AND HU GHES , J. 1989 . An iterative powerdomain construction. In Functional Programming . Proceedings of the 1989 Glasgow workshop, K. Davis and J. Hughes, Eds. Springer Verlag , Berlin. FERGUSON, t. AND HUGHES, J. 1989. An iterative powerdomain construction. In Functional Programming. Proceedings of the 1989 Glasgow workshop, K. Davis and J. Hughes, Eds. Springer Verlag, Berlin."},{"key":"e_1_2_1_21_1","first-page":"655","volume-title":"Logic Programming--Proceedings of the 1994 International Symposium, M. Bruynooghe, Ed. The MIT Press","author":"FILI~ G.","year":"1994","unstructured":"FILI~ , G. AND RANZATO , F. 1994 . Improving abstract interpretations by systematic lifting to the powerset . In Logic Programming--Proceedings of the 1994 International Symposium, M. Bruynooghe, Ed. The MIT Press , Cambridge, Mass. , 655 - 669 . FILI~, G. AND RANZATO, F. 1994. Improving abstract interpretations by systematic lifting to the powerset. In Logic Programming--Proceedings of the 1994 International Symposium, M. Bruynooghe, Ed. The MIT Press, Cambridge, Mass., 655-669."},{"key":"e_1_2_1_22_1","volume-title":"Handbook of Theoretical Computer Science","author":"GUNTER C.","unstructured":"GUNTER , C. AND SCOTT , D. 1990. Semantic domains . In Handbook of Theoretical Computer Science , J. van Leeuwen, Ed. Vol. B, Formal Models and Semantics. North-Holland, Amsterdam . GUNTER, C. AND SCOTT, D. 1990. Semantic domains. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. B, Formal Models and Semantics. North-Holland, Amsterdam."},{"key":"e_1_2_1_23_1","first-page":"202","volume-title":"Proceedings of the 21st Symposium on Principles of Programming Languages. ACM Press","author":"HANKIN C.","unstructured":"HANKIN , C. AND LE MI~TAYER, D. 1994. Deriving algorithms from type inference systems: Applications to strictness analysis . In Proceedings of the 21st Symposium on Principles of Programming Languages. ACM Press , New York , 202 - 212 . 10.1145\/174675.177858 HANKIN, C. AND LE MI~TAYER, D. 1994. Deriving algorithms from type inference systems: Applications to strictness analysis. In Proceedings of the 21st Symposium on Principles of Programming Languages. ACM Press, New York, 202-212. 10.1145\/174675.177858"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(95)00012-7"},{"key":"e_1_2_1_25_1","volume-title":"Flow Analysis of Computer Programs. Programming Languages Series. North-Holland","author":"HECHT M. S.","unstructured":"HECHT , M. S. 1977. Flow Analysis of Computer Programs. Programming Languages Series. North-Holland , New York . HECHT, M. S. 1977. Flow Analysis of Computer Programs. Programming Languages Series. North-Holland, New York."},{"key":"e_1_2_1_27_1","volume-title":"Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press","author":"HUNT S.","year":"1991","unstructured":"HUNT , S. AND SANDS , D. 1991 . Binding time analysis: A new PERspective . In Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press , New York. 10.1145\/115865.115881 HUNT, S. AND SANDS, D. 1991. Binding time analysis: A new PERspective. In Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation. ACM Press, New York. 10.1145\/115865.115881"},{"key":"e_1_2_1_28_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 1st International Static Analysis Symposium (SAS'9g), B. Le Charlier, Ed","author":"JENSEN K. D.","unstructured":"JENSEN , K. D. , HJ _\/ER ESEN , P., AND ROSENDAHL , M. 1994. Efficient strictness analysis of Haskell . In Proceedings of the 1st International Static Analysis Symposium (SAS'9g), B. Le Charlier, Ed . Lecture Notes in Computer Science , vol. 864 . Springer-Verlag , Berlin , 346-362. JENSEN, K. D., HJ_\/ERESEN, P., AND ROSENDAHL, M. 1994. Efficient strictness analysis of Haskell. In Proceedings of the 1st International Static Analysis Symposium (SAS'9g), B. Le Charlier, Ed. Lecture Notes in Computer Science, vol. 864. Springer-Verlag, Berlin, 346-362."},{"key":"e_1_2_1_29_1","first-page":"352","volume-title":"Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science","volume":"523","author":"JENSEN T.","year":"1991","unstructured":"JENSEN , T. 1991 . Strictness analysis in logical form . In Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science , vol. 523 . Springer-Verlag, Berlin , 352 - 366 . JENSEN, T. 1991. Strictness analysis in logical form. In Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 352-366."},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 2nd Bordeaux Workshop on Static Analysis, M. Billaud, P. Cast6ran, M. Corsini, K. Musumbu, and A. Rauzy, Eds. Bigre no. 81-82","author":"JENSEN T.","year":"1992","unstructured":"JENSEN , T. 1992 b. Axiomatising uniform properties of recursive data structures . In Proceedings of the 2nd Bordeaux Workshop on Static Analysis, M. Billaud, P. Cast6ran, M. Corsini, K. Musumbu, and A. Rauzy, Eds. Bigre no. 81-82 . IRISA, Rennes, France. JENSEN, T. 1992b. Axiomatising uniform properties of recursive data structures. In Proceedings of the 2nd Bordeaux Workshop on Static Analysis, M. Billaud, P. Cast6ran, M. Corsini, K. Musumbu, and A. Rauzy, Eds. Bigre no. 81-82. IRISA, Rennes, France."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 7th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.","author":"JENSEN T.","year":"1992","unstructured":"JENSEN , T. 1992 c. Disjunctive strictness analysis . In Proceedings of the 7th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif. JENSEN, T. 1992c. Disjunctive strictness analysis. In Proceedings of the 7th IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, Calif."},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 5th IEEE International Conference on Computer Languages, H. Bal, Ed. IEEE Press","author":"JENSEN T.","year":"1994","unstructured":"JENSEN , T. 1994 . Abstract interpretation over algebraic data types . In Proceedings of the 5th IEEE International Conference on Computer Languages, H. Bal, Ed. IEEE Press , New York. JENSEN, T. 1994. Abstract interpretation over algebraic data types. In Proceedings of the 5th IEEE International Conference on Computer Languages, H. Bal, Ed. IEEE Press, New York."},{"issue":"4","key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/5.4.397","article-title":"Conjunctive type systems and abstract interpretation of higher-order functional programs","volume":"5","author":"JENSEN T.","year":"1995","unstructured":"JENSEN , T. 1995 . Conjunctive type systems and abstract interpretation of higher-order functional programs . J. Logic Comput. 5 , 4 , 397 - 421 . JENSEN, T. 1995. Conjunctive type systems and abstract interpretation of higher-order functional programs. J. Logic Comput. 5, 4, 397-421.","journal-title":"J. Logic Comput."},{"key":"e_1_2_1_35_1","series-title":"Series in Computer Science","volume-title":"Partial Evaluation and Automatic Program Generation","author":"JONES N.","unstructured":"JONES , N. , GOMARD , C. , AND SESTOFT , P. 1993. Partial Evaluation and Automatic Program Generation . Series in Computer Science . Prentice-Hall International , Chichester, U.K. JONES, N., GOMARD, C., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Series in Computer Science. Prentice-Hall International, Chichester, U.K."},{"key":"e_1_2_1_36_1","volume-title":"Program Flow Analysis: Theory and Applications","author":"JONES N.","unstructured":"JONES , N. AND MUCHNICK , S. 1981. Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra . In Program Flow Analysis: Theory and Applications , N. Jones and S. Muchnick, Eds. Prentice-Hall, Englewood Cliffs , N.J. JONES, N. AND MUCHNICK, S. 1981. Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra. In Program Flow Analysis: Theory and Applications, N. Jones and S. Muchnick, Eds. Prentice-Hall, Englewood Cliffs, N.J."},{"key":"e_1_2_1_37_1","series-title":"Lecture Notes in Computer Science","volume-title":"An experiment in partial evaluation: Th e generation of a compiler generator","author":"JONES N.","unstructured":"JONES , N. , SESTOFT , P. , AND SONDERGAARD , H. 1985. An experiment in partial evaluation: Th e generation of a compiler generator . In Rewriting Techniques and Applications, J. P. Jouannaud, Ed. Lecture Notes in Computer Science , vol. 202 . Springer-Verlag , Berlin , 124- 140. JONES, N., SESTOFT, P., AND SONDERGAARD, H. 1985. An experiment in partial evaluation: Th e generation of a compiler generator. In Rewriting Techniques and Applications, J. P. Jouannaud, Ed. Lecture Notes in Computer Science, vol. 202. Springer-Verlag, Berlin, 124- 140."},{"key":"e_1_2_1_38_1","first-page":"296","volume-title":"Proceedings of the 13th A CM Symposium on Principles of Programming Languages. ACM Press","author":"JONES N. D.","year":"1986","unstructured":"JONES , N. D. AND MYCROFT , A. 1986 . Data flow analysis of applicative programs using minimal function graphs . In Proceedings of the 13th A CM Symposium on Principles of Programming Languages. ACM Press , New York , 296 - 306 . 10.1145\/512644.512672 JONES, N. D. AND MYCROFT, A. 1986. Data flow analysis of applicative programs using minimal function graphs. In Proceedings of the 13th A CM Symposium on Principles of Programming Languages. ACM Press, New York, 296-306. 10.1145\/512644.512672"},{"key":"e_1_2_1_40_1","first-page":"88","volume-title":"Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, W. Scherlis, Ed. ACM Press","author":"LE AYER","year":"1995","unstructured":"LE ~\/{}~T AYER , D. 1995 . Proving properties of programs defined over recursive data structures . In Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, W. Scherlis, Ed. ACM Press , New York , 88 - 99 . 10.1145\/215465.215567 LE ~\/{}~TAYER, D. 1995. Proving properties of programs defined over recursive data structures. In Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, W. Scherlis, Ed. ACM Press, New York, 88-99. 10.1145\/215465.215567"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 5th A CM Conference on Functional Programming Languages and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science","volume":"523","author":"LEUNG A.","year":"1991","unstructured":"LEUNG , A. AND ~\/{I SHRA , P. 1991 . Reasoning about simple and exhaustive demand in higherorder lazy languages . In Proceedings of the 5th A CM Conference on Functional Programming Languages and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science , vol. 523 . Springer-Verlag, Berlin. LEUNG, A. AND ~\/{ISHRA, P. 1991. Reasoning about simple and exhaustive demand in higherorder lazy languages. In Proceedings of the 5th A CM Conference on Functional Programming Languages and Computer Architecture, J. Hughes, Ed. Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin."},{"key":"e_1_2_1_42_1","volume-title":"Partial Eva luation and Mixed Computation","author":"OGENSEN T.","unstructured":"OGENSEN , T. 1988. Partially static structures in a self-applicable partial evMuator . In Partial Eva luation and Mixed Computation , D. Bj~rner, A. P. Ershov, and N. D. Jones, Eds. North- Holland , Amsterdam , 325-347. OGENSEN, T. 1988. Partially static structures in a self-applicable partial evMuator. In Partial Eva luation and Mixed Computation, D. Bj~rner, A. P. Ershov, and N. D. Jones, Eds. North- Holland, Amsterdam, 325-347."},{"key":"e_1_2_1_43_1","first-page":"122","volume-title":"Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, W. Scherlis, Ed. ACM Press","author":"VONSUEZ B.","year":"1995","unstructured":"i VONSUEZ , B. 1995 . Using abstract interpretation to define a strictness type inference system . In Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, W. Scherlis, Ed. ACM Press , New York , 122 - 133 . 10.1145\/215465.215574 iVONSUEZ, B. 1995. Using abstract interpretation to define a strictness type inference system. In Proceedings of the A CM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, W. Scherlis, Ed. ACM Press, New York, 122-133. 10.1145\/215465.215574"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF00263194","article-title":"A denotationM framework for data flow analysis","volume":"18","author":"NIELSON F.","year":"1982","unstructured":"NIELSON , F. 1982 . A denotationM framework for data flow analysis . Acta Informatica 18 , 265 - 287 . NIELSON, F. 1982. A denotationM framework for data flow analysis. Acta Informatica 18, 265-287.","journal-title":"Acta Informatica"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the ~th Hungarian Computer Science Conference. 211-225","author":"NIELSON F.","year":"1985","unstructured":"NIELSON , F. 1985 . Tensor products generalize the relational data flow analysis method . In Proceedings of the ~th Hungarian Computer Science Conference. 211-225 . NIELSON, F. 1985. Tensor products generalize the relational data flow analysis method. In Proceedings of the ~th Hungarian Computer Science Conference. 211-225."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(94)00009-3"},{"key":"e_1_2_1_49_1","volume-title":"Proceedings of the ~th European Symposium on Programming, B. Krieg-Briickner, Ed. Lecture Notes in Computer Science","volume":"582","author":"NIELSON H. R.","year":"1992","unstructured":"NIELSON , H. R. AND NIELSON , F. 1992 . The tensor product in Wadler's analysis of lists . In Proceedings of the ~th European Symposium on Programming, B. Krieg-Briickner, Ed. Lecture Notes in Computer Science , vol. 582 . Springer-Verlag, Berlin. NIELSON, H. R. AND NIELSON, F. 1992. The tensor product in Wadler's analysis of lists. In Proceedings of the ~th European Symposium on Programming, B. Krieg-Briickner, Ed. Lecture Notes in Computer Science, vol. 582. Springer-Verlag, Berlin."},{"issue":"3","key":"e_1_2_1_50_1","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"PLOTKIN G. D.","year":"1976","unstructured":"PLOTKIN , G. D. 1976 . A powerdomain construction . SIAM J. Comput. 5 , 3 , 452 - 487 . PLOTKIN, G. D. 1976. A powerdomain construction. SIAM J. Comput. 5, 3, 452-487.","journal-title":"SIAM J. Comput."},{"key":"e_1_2_1_51_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 2nd International Conference on Algorithms, Languages and Programming","author":"REYNOLDS J. C.","unstructured":"REYNOLDS , J. C. 1974. On the relation between direct and continuation semantics . In Proceedings of the 2nd International Conference on Algorithms, Languages and Programming . Lecture Notes in Computer Science , vol. 14 . Springer-Verlag , Berlin , 141-156. REYNOLDS, J. C. 1974. On the relation between direct and continuation semantics. In Proceedings of the 2nd International Conference on Algorithms, Languages and Programming. Lecture Notes in Computer Science, vol. 14. Springer-Verlag, Berlin, 141-156."},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-57186-8_89","volume-title":"Proceedings of Programming Language Implementation and Logic Programming (PLILP'93)","volume":"714","author":"ROSENDAHL","year":"1993","unstructured":"ROSENDAHL , ~\/{. 1993 . Higher-order chaotic iteration sequences . In Proceedings of Programming Language Implementation and Logic Programming (PLILP'93) , M. Bruynooghe and J. Penjam, Eds. Lecture Notes in Computer Science , vol. 714 . Springer-Verlag, Berlin, 332 - 345 . ROSENDAHL, ~\/{. 1993. Higher-order chaotic iteration sequences. In Proceedings of Programming Language Implementation and Logic Programming (PLILP'93), M. Bruynooghe and J. Penjam, Eds. Lecture Notes in Computer Science, vol. 714. Springer-Verlag, Berlin, 332-345."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/800235.807086"},{"key":"e_1_2_1_54_1","volume-title":"Abstract Interpretation of Declarative Languages","author":"WADLER P.","unstructured":"WADLER , P. 1987. Strictness analysis in non-flat domains (by abstract interpretation over finite domains) . In Abstract Interpretation of Declarative Languages , S. Abramsky and C. Hankin, Eds. Ellis Horwood , Chichester, U.K. WADLER, P. 1987. Strictness analysis in non-flat domains (by abstract interpretation over finite domains). In Abstract Interpretation of Declarative Languages, S. Abramsky and C. Hankin, Eds. Ellis Horwood, Chichester, U.K."},{"key":"e_1_2_1_55_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the Conference on Functional Programming and Computer Architecture","author":"WADLER P.","unstructured":"WADLER , P. AND HUGHES , R. J. ~\/{. 1987. Projections for strictness analysis . In Proceedings of the Conference on Functional Programming and Computer Architecture . Lecture Notes in Computer Science , vol. 274 . Springer-Verlag , Berlin . WADLER, P. AND HUGHES, R. J. ~\/{. 1987. Projections for strictness analysis. In Proceedings of the Conference on Functional Programming and Computer Architecture. Lecture Notes in Computer Science, vol. 274. Springer-Verlag, Berlin."},{"key":"e_1_2_1_56_1","volume-title":"Foundations of Computation Theory","author":"WINSKEL G.","unstructured":"WINSKEL , G. 1983. Powerdomains and modMity . In Foundations of Computation Theory , M. Karpinski, Ed. Lecture Notes in Computer Science, vol. 158 . Springer-Verlag , Berlin. WINSKEL, G. 1983. Powerdomains and modMity. In Foundations of Computation Theory, M. Karpinski, Ed. Lecture Notes in Computer Science, vol. 158. Springer-Verlag, Berlin."}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/265943.265966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T18:33:40Z","timestamp":1672425220000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/265943.265966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["10.1145\/265943.265966"],"URL":"http:\/\/dx.doi.org\/10.1145\/265943.265966","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":["Software"],"published":{"date-parts":[[1997,9]]},"assertion":[{"value":"1997-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}