{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:03Z","timestamp":1725664323753},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603603"},{"type":"electronic","value":"9783540450504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60360-3_41","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:20:01Z","timestamp":1330262401000},"page":"207-224","source":"Crossref","is-referenced-by-count":6,"title":["Effective flow analysis for avoiding run-time checks"],"prefix":"10.1007","author":[{"given":"Suresh","family":"Jagannathan","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Wright","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Alexander Aiken and Wimmers, Edward and T.K Lakshman. Soft Typing with Conditional Types. In 21th ACM Symposium on Principles of Programming Languages, pages 163\u2013173, 1994.","DOI":"10.1145\/174675.177847"},{"key":"14_CR2","volume-title":"The Lambda Calculus","author":"H. Barendregt","year":"1981","unstructured":"Henk Barendregt. The Lambda Calculus. North-Holland, Amsterdam, 1981."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"William Clinger and Jonathan Rees, editors. Revised4 Report on the Algorithmic Language Scheme. ACM Lisp Pointers, 4(3), July 1991.","DOI":"10.1145\/1317265.1317268"},{"key":"14_CR4","unstructured":"Kent Dybvig. The Scheme Programming Language. Prentice-Hall, Inc., 1987."},{"issue":"2\/3","key":"14_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01018696","volume":"7","author":"M. Feeley","year":"1994","unstructured":"Marc Feeley, Marc Turcotte, and Guy Lapalme. Using MultiLisp for Solving Constraint Satistfaction Problems: An Application to Nucleic Acid 3D Structure Determination. Lisp and Symbolic Computation, 7(2\/3):231\u2013248, 1994.","journal-title":"Lisp and Symbolic Computation"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Leslie Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. ACM Press, 1987.","DOI":"10.7551\/mitpress\/5750.001.0001"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Nevin Heintze. Set-Based Analysis of ML Programs. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 306\u2013317, 1994.","DOI":"10.1145\/182409.182495"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Fritz Henglein. Global Tagging Optimization by Type Inference. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 205\u2013215, 1992.","DOI":"10.1145\/141471.141542"},{"key":"14_CR9","first-page":"29","volume":"146","author":"R. Hindley","year":"1969","unstructured":"R. Hindley. The Principal Type-Scheme of an Object in Combinatory Logic. Transactions of the American Mathematical Society, 146:29\u201360, December 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Suresh Jagannathan and Stephen Weeks. A Unified Treatment of Flow Analysis in Higher-Order Languages. In 22th ACM Symposium on Principles of Programming Languages, pages 392\u2013401, January 1995.","DOI":"10.1145\/199448.199536"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Neil Jones and Stephen Muchnick. Flow Analysis and Optimization of Lisp-like Structures. In 6th ACM Symposium on Principles of Programming Languages, pages 244\u2013256, January 1979.","DOI":"10.1145\/567752.567776"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Robin Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR13","unstructured":"Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"John Mitchell. Handbook of Theoretical Computer Science: Volume B, chapter Type Systems for Programming Languages, pages 367\u2013453. MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Jens Palsberg. Global Program Analysis in Constraint Form. In Proceedings of the 1994 Colloquium on Trees in Algebra and Programming, pages 276\u2013290. Springer-Verlag, 1994. Appears as LNCS 787.","DOI":"10.1007\/BFb0017488"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Jens Palsberg and Patrick O'Keefe. A Type System Equivalent to Flow Analysis. In 22th ACM Symposium on Principles of Programming Languages, pages 367\u2013378, January 1995.","DOI":"10.1145\/199448.199533"},{"key":"14_CR17","unstructured":"Jens Palsberg and Michael Schwartzbach. Safety Analysis versus Type Inference. Information and Computation, to appear."},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"Gordon D. D. Plotkin","year":"1975","unstructured":"Gordon D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"14_CR19","unstructured":"Olin Shivers. Data-flow Analysis and Type Recovery in Scheme. In Topics in Advanced Language Implementation. MIT Press, 1990."},{"key":"14_CR20","unstructured":"Olin Shivers. Control-Flow Analysis of Higher-Order Languages or Taming Lambda. PhD thesis, School of Computer Science, Carnegie-Mellon University, 1991."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Peter Steenkiste and John Hennessy. Tags and type checking in lisp. In Proceedings of the Second Architectural Support for Programming Languages and Systems Symposium, pages 50\u201359, 1987.","DOI":"10.1145\/36205.36183"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Andrew Wright and Robert Cartwright. A Practical Soft Type System for Scheme. In Proceedings of the ACM Symposium on Lisp and Functional Programming, pages 250\u2013262, 1994.","DOI":"10.1145\/182409.182485"},{"key":"14_CR23","unstructured":"Feng Zhao. An O(N) Algorithm for Three-Dimensional N-Body Simulations. Master's thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 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_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:43:56Z","timestamp":1640925836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60360-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603603","9783540450504"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-60360-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}