{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:36Z","timestamp":1763467716538},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634683"},{"type":"electronic","value":"9783540695769"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0032745","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T01:56:10Z","timestamp":1133402170000},"page":"232-249","source":"Crossref","is-referenced-by-count":7,"title":["Type-directed flow analysis for typed intermediate languages"],"prefix":"10.1007","author":[{"given":"Suresh","family":"Jagannathan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Weeks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Aiken, A., and Wimmers, E. L. Type inclusion constraints and type inference. Proceedings of the International Conference on Functional Programming Languages and Computer Architecture (1993), 31\u201341.","DOI":"10.1145\/165180.165188"},{"key":"16_CR2","unstructured":"Aiken, A., Wimmers, E. L., and Lakshman, T. K. Soft typing with conditional types. In Proc. ACM Symp. Principles of Programming Languages (Jan. 1993), pp. 163\u2013173."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bacon, D. F., and Sweeney, P. F. Fast static analyses of C++ virtual function calls. In OOPSLA (1996).","DOI":"10.1145\/236337.236371"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Banerjee, A. A modular, polyvariant, and type-based closure analysis. In Intl. Conf. Functional Programming (June 1997).","DOI":"10.1145\/258948.258951"},{"key":"16_CR5","first-page":"3","volume":"4","author":"C. Chambers","year":"1991","unstructured":"Chambers, C., and Ungar, D. Iterative type analysis and extended messagesplitting: Optimizing dynamically-typed object-oriented programs. Lisp and Symbolic Computation 4, 3 (1991).","journal-title":"Lisp and Symbolic Computation"},{"key":"16_CR6","unstructured":"Dimock, A., Muller, R., Turbak, F., and Wells, J. Strongly typed flow-directed representation transformations. In Proceedings of the International Conference on Functional Programming Languages (1997), pp. 11\u201324."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Flanagan, C., and Felleisen, M. Componential set-based analysis. In Proc. ACM Conf. Programming Language Design and Implementation (June 1997).","DOI":"10.1145\/258915.258937"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y. Une extension de l'interpr\u00e9tation de G\u00f6del \u00e0 l'analyse, et son application \u00e0 l'\u00e9limination des coupures dans l'analyse et la th\u00e9orie des types. In Proceedings of the 2nd Scandinavian Logic Symposium (1971), J. E. Fenstad, Ed., North-Holland, pp. 63\u201392.","DOI":"10.1016\/S0049-237X(08)70843-7"},{"issue":"2","key":"16_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/169701.169696","volume":"15","author":"R. Harper","year":"1993","unstructured":"Harper, R., and Mitchell, J. C. On the type structure of Standard ML. ACM Transactions on Programming Languages and Systems 15, 2 (Apr. 1993), 211\u2013252.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Harper, R., and Morrisett, J. G. Compiling polymorphism using intensional type analysis. In Proc. ACM Symp. Principles of Programming Languages (Jan. 1995), ACM, pp. 130\u2013141.","DOI":"10.1145\/199448.199475"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Heintze, N. Set-based analysis of ML programs. In Proc. ACM Symp. Lisp and Functional Programming (1994), pp. 306\u2013317.","DOI":"10.1145\/182409.182495"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Heintze, N. Control-flow analysis and type systems. In Proc. Intl. Static Analysis Symposium (Sept. 1995), pp. 189\u2013206. Also appears as CMU-CS-94-227.","DOI":"10.1007\/3-540-60360-3_40"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Heintze, N., and McAllester, D. Linear-time subtransitive control flow analysis. In Proc. ACM Conf. Programming Language Design and Implementation (June 1997).","DOI":"10.1145\/258915.258939"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Henglein, F., and Mossin, C. Polymorphic binding-time analysis. In Proc. European Symp. Programming (Apr. 1994), D. Sannella, Ed., vol. 788 of Lecture Notes in Computer Science, pp. 287\u2013301.","DOI":"10.1007\/3-540-57880-3_19"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Jagannathan, S., and Weeks, S. T. A unified treatment of flow analysis in higher-order languages. In Proc. ACM Symp. Principles of Programming Languages (Jan. 1995), pp. 393\u2013407.","DOI":"10.1145\/199448.199536"},{"key":"16_CR16","unstructured":"Jagannathan, S., and Wright, A. K. Effective flow analysis for avoiding runtime checks. In Proc. Intl. Static Analysis Symposium (Sept. 1995), mycroft, Ed., no. 983 in Lecture Notes in Computer Science, Springer-Verlag, pp. 207\u2013224."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Jagannathan, S., and Wright, A. K. Flow-directed inlining. In Proc. ACM Conf. Programming Language Design and Implementation (May 1996), pp. 193\u2013205.","DOI":"10.1145\/231379.231417"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Nielson, F., and Nielson, H. R. Infinitary control flow analysis: a collecting semantics for closure analysis. In Proc. ACM Symp. Principles of Programming Languages (Jan. 1997), ACM, pp. 332\u2013345.","DOI":"10.1145\/263699.263745"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Palsberg, J., and O'Keefe, P. A type system equivalent to flow analysis. In Proc. ACM Symp. Principles of Programming Languages (Jan. 1995), ACM, pp. 367\u2013378.","DOI":"10.1145\/199448.199533"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S. L. Compiling Haskell by program transformation: a report from the trenches. In Proc. European Symp. Programming (Apr. 1996).","DOI":"10.1007\/3-540-61055-3_27"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Plevyak, J., and Chien, A. A. Precise concrete type inference of object-oriented programs. In OOPSLA (1994).","DOI":"10.1145\/191080.191130"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Reynolds, J. C. Towards a theory of type structure. In Paris Colloquium on Programming (1974), no. 19 in Lecture Notes in Computer Science, Springer-Verlag, pp. 408\u2013425.","DOI":"10.1007\/3-540-06859-7_148"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Schmidt, D. Natural-semantics-based abstract interpretation (preliminary version). In Proc. Intl. Static Analysis Symposium (Sept. 1995), A. Mycroft, Ed., no. 983 in Lecture Notes in Computer Science, Springer-Verlag, pp. 1\u201318.","DOI":"10.1007\/3-540-60360-3_28"},{"key":"16_CR24","unstructured":"Sharir, M., and Pnueli, A. Two approaches to interprocedural dataflow analysis. In Program Flow Analysis: Theory and Applications, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, 1981, pp. 189\u2013235."},{"key":"16_CR25","unstructured":"Shivers, O.Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, Carnegie Mellon University, Computer Science Department, 1991."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Tarditi, D., Morrisett, J. G., Cheng, P., Stone, C., Harper, R., and Lee, P. TIL: A type-directed optimizing compiler for ML. In Proc. ACM Conf. Programming Language Design and Implementation (May 1996).","DOI":"10.1145\/231379.231414"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Turner, D. N., Wadler, P., and Mossin, C. Once upon a type. In Proc. Conf. Functional Programming and Computer Architecture (June 1995). *** DIRECT SUPPORT *** A0008C44 00006","DOI":"10.1145\/224164.224168"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032745","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:24:11Z","timestamp":1586579051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634683","9783540695769"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0032745","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}