{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:47:34Z","timestamp":1784180854371,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642415814","type":"print"},{"value":"9783642415821","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41582-1_8","type":"book-chapter","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T12:38:21Z","timestamp":1384519101000},"page":"122-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Type- and Control-Flow Analysis for System\u00a0F"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Fluet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,11,16]]},"reference":[{"issue":"2\u20133","key":"8_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0167-6423(99)00007-6","volume":"35","author":"A Aiken","year":"1999","unstructured":"Aiken, A.: Introduction to set constraint-based program analysis. Sci. Comput. Program. 35(2\u20133), 79\u2013111 (1999)","journal-title":"Sci. Comput. Program."},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Aiken, A., Murphy, B.R.: Implementing regular tree expressions. In: Conference on Functional Programming Languages and Computer Architecture (FPCA). LNCS, vol. 523, pp. 427\u2013447, August 1991","DOI":"10.1007\/3540543961_21"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Aiken, A., Murphy, B.R.: Static type inference in a dynamically typed language. In: Symposium on Principles of Programming Languages (POPL), pp. 279\u2013290, January 1991","DOI":"10.1145\/99583.99621"},{"key":"8_CR4","first-page":"56","volume-title":"ESOP 2000. LNCS","author":"H Cejtin","year":"2000","unstructured":"Cejtin, H., Jagannathan, S., Weeks, S.: Flow-directed closure conversion for typed languages. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol. 1782, pp. 56\u201371. Springer, Heidelberg (2000)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game-theoretic form, invited paper. In: Conference on Computer Aided Verification (CAV). LNCS, vol. 939, pp. 293\u2013308, July 1995","DOI":"10.1007\/3-540-60045-0_58"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In: Conference on Functional Programming Languages and Computer Architecture (FPCA), pp. 170\u2013181, June 1995","DOI":"10.1145\/224164.224199"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Flanagan, C., Sabry, A., Duba, B.F., Felleisen, M.: The essence of compiling with continuations. In: Conference on Programming Language Design and Implementation (PLDI), pp. 237\u2013247, June 1993","DOI":"10.1145\/173262.155113"},{"key":"8_CR8","unstructured":"Fluet, M.: A type- and control-flow analysis for System F. Tech. rep., Rochester Institute of Technology. https:\/\/ritdml.rit.edu\/handle\/1850\/15920, February 2013"},{"key":"8_CR9","volume-title":"Tree Automata","author":"F Gecseg","year":"1984","unstructured":"Gecseg, F., Steinby, M.: Tree Automata. Akademiai Kiado, Budapest (1984)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0049-237X(08)70843-7","volume":"63","author":"JY Girard","year":"1971","unstructured":"Girard, J.Y.: Une extension de l\u2019interpretation de G\u00f6del \u00e0 l\u2019analyse, et son application \u00e0 l\u2019\u00e9limination des coupures dans l\u2019analyse et la th\u00e9orie des types. In: Scandinavian Logic Symposium. Stud. Logic Found. Math. 63, 63\u201392 (1971)","journal-title":"Stud. Logic Found. Math."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Harper, R., Morrisett, G.: Compiling polymorphism using intensional type analysis. In: Symposium on Principles of Programming Languages (POPL), pp. 130\u2013141, Januay 1995","DOI":"10.21236\/ADA285340"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Heintze, N.: Set-based program analysis of ML programs. In: Conference on Lisp and Functional Programming (LFP), pp. 306\u2013317, June 1994","DOI":"10.1145\/182590.182495"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Heintze, N., Jaffar, J.: A finite presentation theorem for approximating logic programs. In: Symposium on Principles of Programming Languages (POPL), pp. 197\u2013209, January 1990","DOI":"10.1145\/96709.96729"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F Henglein","year":"1993","unstructured":"Henglein, F.: Type inference with polymorphic recursion. ACM Trans. Program. Lang. Syst. 15(2), 253\u2013289 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Jagannathan, S., Weeks, S., Wright, A.K.: Type-directed flow analysis for typed intermediate languages. In: International Symposium on Static Analysis (SAS). LNCS, vol. 1302, pp. 232\u2013249, September 1997","DOI":"10.1007\/BFb0032745"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Jones, N.D.: Flow analysis of lambda expressions (preliminary version). In: International Colloquium on Automata, Languages and Programming (ICALP). LNCS, vol. 115, pp. 114\u2013128, July 1981","DOI":"10.1007\/3-540-10843-2_10"},{"key":"8_CR17","first-page":"103","volume-title":"Abstract Interpretation of Declarative Languages, Chap. 4","author":"ND Jones","year":"1987","unstructured":"Jones, N.D.: Flow analysis of lazy higher-order functional programs. In: Abramsky, S., Hankin, C. (eds.) Abstract Interpretation of Declarative Languages, Chap. 4, pp. 103\u2013122. Ellis Horwood, Chicheste (1987)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Jones, N.D., Muchnick, S.S.: Flow analysis and optimization of LISP-like structures. In: Symposium on Principles of Programming Languages (POPL), pp. 244\u2013256, January 1979","DOI":"10.1145\/567752.567776"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1145\/169701.169687","volume":"15","author":"A Kfoury","year":"1993","unstructured":"Kfoury, A., Tiuryn, J., Urzyczyn, P.: Type reconstruction in the presence of polymorphic recursion. ACM Trans. Program. Lang. Syst. 15(2), 290\u2013311 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Launchbury, J., Peyton Jones, S.: Lazy functional state threads. In: Conference on Programming Language Design and Implementation (PLDI), pp. 24\u201335, June 1994","DOI":"10.1145\/773473.178246"},{"issue":"4","key":"8_CR21","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01018827","volume":"8","author":"J Launchbury","year":"1995","unstructured":"Launchbury, J., Peyton Jones, S.: State in Haskell. Lisp Symbolic Comput. 8(4), 293\u2013341 (1995)","journal-title":"Lisp Symbolic Comput."},{"issue":"3","key":"8_CR22","doi-asserted-by":"publisher","first-page":"10:1","DOI":"10.1145\/2187671.2187672","volume":"44","author":"J Midtgaard","year":"2012","unstructured":"Midtgaard, J.: Control-flow analysis of functional programs. ACM Comput. Surv. 44(3), 10:1\u201310:33 (2012)","journal-title":"ACM Comput. Surv."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Midtgaard, J., Adams, M., Might, M.: A structural soundness proof for Shivers\u2019s escape technique. In: International Symposium on Static Analysis (SAS). LNCS, vol. 7460, pp. 352\u2013369, September 2012","DOI":"10.1007\/978-3-642-33125-1_24"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Mishra, P., Reddy, U.S.: Declaration-free type checking. In: Symposium on Principles of Programming Languages (POPL), pp. 7\u201321. ACM, January 1985","DOI":"10.1145\/318593.318603"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Mycroft, A.: Polymorphic type schemes and recursive definitions. In: International Symposium on Programming. LNCS, vol. 167, pp. 217\u2013228, April 1984","DOI":"10.1007\/3-540-12925-1_41"},{"key":"8_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03811-6","volume-title":"Principles of Program Analysis","author":"F Nielson","year":"1999","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Heidelberg (1999)"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Palsberg, J.: Type-based analysis and applications. In: Workshop on Programming Analysis for Software Tools and Engineering (PASTE), pp. 20\u201327 (2001)","DOI":"10.1145\/379605.379635"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Peyton Jones, S.: Compiling Haskell by program transformation: A report from the trenches. In: European Symposium on Programming (ESOP). LNCS, vol. 1058, pp. 18\u201344, April 1996","DOI":"10.1007\/3-540-61055-3_27"},{"issue":"1","key":"8_CR29","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10990-006-8611-7","volume":"19","author":"F Pottier","year":"2006","unstructured":"Pottier, F., Gauthier, N.: Polymorphic typed defunctionalization and concretization. Higher-Order Symbolic Comput. 19(1), 125\u2013162 (2006)","journal-title":"Higher-Order Symbolic Comput."},{"key":"8_CR30","doi-asserted-by":"crossref","unstructured":"Reppy, J.: Type-sensitive control-flow analysis. In: Workshop on ML (ML). pp. 74\u201383, September 2006","DOI":"10.1145\/1159876.1159888"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Reynolds, J.: Towards a theory of type structure. In: International Symposium on Programming. LNCS, vol. 19, pp. 408\u2013425, April 1974","DOI":"10.1007\/3-540-06859-7_148"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Rossberg, A., Russo, C., Dreyer, D.: F-ing modules. In: Workshop on Types in Language Design and Implementation (TLDI), pp. 89\u2013102, January 2010","DOI":"10.1145\/1708016.1708028"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Serrano, M.: Control flow analysis: a functional languages compilation paradigm. In: Symposium on Applied Computing (SAC), pp. 118\u2013122, Feburary 1995","DOI":"10.1145\/315891.315934"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Sestoft, P.: Replacing function parameters by global variables. In: Conference on Functional Programming Languages and Computer, Architecture (FPCA), pp. 39\u201353, September 1989","DOI":"10.1145\/99370.99374"},{"key":"8_CR35","doi-asserted-by":"crossref","unstructured":"Shivers, O.: Control-flow analysis in Scheme. In: Conference on Programming Language Design and Implementation (PLDI), pp. 164\u2013174, June 1988","DOI":"10.1145\/960116.54007"},{"key":"8_CR36","unstructured":"Shivers, O.: Control-Flow Analysis of Higher-Order Languages or Taming Lambda. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, Technical Report CMU-CS-91-145, May 1991"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Sulzmann, M., Chakravarty, M.M.T., Peyton Jones, S., Donnelly, K.: System F with type equality coercions. In: Workshop on Types in Language Design and Implementation (TLDI), pp. 53\u201366, January 2007","DOI":"10.1145\/1190315.1190324"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., Lee, P.: TIL: a type-directed optimizing compiler for ML. In: Conference on Programming Language Design and Implementation (PLDI), pp. 181\u2013192, May 1996","DOI":"10.1145\/249069.231414"},{"issue":"1","key":"8_CR39","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"AK Wright","year":"1994","unstructured":"Wright, A.K., Felleisen, M.: A syntactic approach to type soundness. Inf. Comput. 115(1), 38\u201394 (1994)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41582-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:13:59Z","timestamp":1674227639000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-41582-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415814","9783642415821"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41582-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"16 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}