{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:05:10Z","timestamp":1725487510132},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540420682"},{"type":"electronic","value":"9783540449782"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44978-7_5","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T15:46:22Z","timestamp":1184600782000},"page":"63-83","source":"Crossref","is-referenced-by-count":9,"title":["Constraint Abstractions"],"prefix":"10.1007","author":[{"given":"J\u00f6rgen","family":"Gustavsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Svenningsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,4,25]]},"reference":[{"key":"5_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BFb0014547","volume-title":"Proceedings TACS\u201997 Theoretical Aspects of Computer Software","author":"A. Aiken","year":"1997","unstructured":"A. Aiken, E. Wimmers, and J. Palsberg. Optimal representation of polymorphic types with subtyping. In Proceedings TACS\u201997 Theoretical Aspects of Computer Software, pages 47\u201377. Springer Lecture Notes in Computer Science, vol. 1281, September 1997."},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1017\/S0960129500070109","volume":"6","author":"E. Barendsen","year":"1996","unstructured":"E. Barendsen and S. Smetsers. Uniqueness Typing for Functional Languages with Graph Rewriting Semantics. Mathematical Structures in Computer Science, 6:579\u2013612, 1996.","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR3","first-page":"83","volume-title":"Conference Record of the Ninthteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Conference Record of the Ninthteenth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 83\u201394, Albuquerque, New Mexico, January 1992. ACM Press, New York, NY."},{"key":"5_CR4","unstructured":"P. Curtis. Constrained qualification in polymorphic type analysis. Technical Report CSL-09-1, Xerox Parc, February 1990."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"D. Dussart, F. Henglein, and C. Mossin. Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In proceedings of 2nd Static Analysis Symposium, September 1995.","DOI":"10.1007\/3-540-60360-3_36"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"J. Eifrig, S. Smith, and V. Trifonov. Sound polymorphic type inference for objects. In Proceedings OOPSLA\u201995, 1995.","DOI":"10.1145\/217838.217858"},{"key":"5_CR7","unstructured":"M. F\u00e4ndrich and A. Aiken. Making set-constraint program analyses scale. In Workshop on Set Constraints, 1996."},{"key":"5_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-60360-3_37","volume-title":"Proc. of SAS\u201995","author":"K.-F. Fax\u00e9n","year":"1995","unstructured":"Karl-Filip Fax\u00e9n. Optimizing lazy functional programs using flow inference. In Proc. of SAS\u201995, pages 136\u2013153. Springer-Verlag, LNCS 983, September 1995."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"C. Flanagan and M. Felleisen. Componential set-based analysis. In Proceedings of the ACM SIGPLAN\u201997 Conference on Programming Language Design and Implementation. ACM, June 1997.","DOI":"10.1145\/258915.258937"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"J. Foster, M. F\u00e4ndrich, and A. Aiken. Polymorphic versus Monomorphic Flow-insensitive Points-to Analysis for C. In Proceedings of 2000 Static Analysis Symposium, June 2000.","DOI":"10.1007\/978-3-540-45099-3_10"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Y. Fuh and P. Mishra. Polymorphic subtype inference: Closing the theorypractice gap. In Proceedings of Int\u2019l J\u2019t Conf. on Theory and Practice of Software Development, pages 167\u2013183. Springer-Verlag, March 1989.","DOI":"10.1007\/3-540-50940-2_35"},{"key":"5_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the 12th International Workshop on Implementation of Functional Languages","author":"J. Gustavsson","year":"2000","unstructured":"J. Gustavsson and J. Svenningsson. A usage analysis with bounded usage polymorphism and subtyping. In Proceedings of the 12th International Workshop on Implementation of Functional Languages. Springer-Verlag, LNCS, September 2000. To appear."},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/169701.169692","volume":"15","author":"F. Henglein","year":"1993","unstructured":"Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253\u2013289, April 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/141471.141540","volume-title":"1992 ACM conference on LISP and Functional Programming","author":"S. Kaes","year":"1992","unstructured":"Stefan Kaes. Type inference in the presence of overloading, subtyping and recursive types. In 1992 ACM conference on LISP and Functional Programming, pages 193\u2013204, San Francisco, CA, 1992. ACM Press."},{"key":"5_CR15","volume-title":"PhD thesis","author":"C. Mossin","year":"1997","unstructured":"C. Mossin. Flow Analysis of Typed Higher-Order Programs (Revised Version). PhD thesis, University of Copenhagen, Denmark, August 1997."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"David Melski and Thomas Reps. Interconvertibility of a class of set constraints and context-free language reachability. Theoretical Computer Science, 248, November 2000.","DOI":"10.1016\/S0304-3975(00)00049-9"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"F. Pottier. Simplifying subtyping constraints. In Proceedings ICFP\u201997, International Conference on Functional Programming, pages 122\u2013133. ACM Press, May 1996.","DOI":"10.1145\/232627.232642"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1145\/263699.263738","volume-title":"Proceedings POPL\u201997, 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"J. Rehof","year":"1997","unstructured":"J. Rehof. Minimal typings in atomic subtyping. In Proceedings POPL\u201997, 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 278\u2013291, Paris, France, January 1997. ACM."},{"key":"5_CR19","unstructured":"T. Reps. Program analysis via graph reachability. In Proc. of ILPS\u2019 97, pages 5\u201319. Springer-Verlag, October 1997."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Jakob Rehof and Manuel F\u00e4ndrich. Type-Based Flow Analysis: From Polymorphic Subtyping to CFL-Reachability. In Proceedings of 2001 Symposium on Principles of Programming Languages, 2001.","DOI":"10.1145\/360204.360208"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0167-6423(94)00020-4","volume":"23","author":"G. S. Smith","year":"1994","unstructured":"G. S. Smith. Principal type schemes for functional programs with overloading and subtyping. Science of Computer Programming, 23:197\u2013226, 1994.","journal-title":"Science of Computer Programming"},{"key":"5_CR22","unstructured":"Josef Svenningsson. An efficient algorithm for a sharing analysis with polymorphism and subtyping. Masters thesis, June 2000."},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/3-540-61739-6_52","volume-title":"Proceedings SAS\u201996, Static Analysis Symposium","author":"V. Trifonov","year":"1996","unstructured":"V. Trifonov and S. Smith. Subtyping constrained types. In Proceedings SAS\u201996, Static Analysis Symposium, pages 349\u2013365, Aachen, Germany, 1996. Springer Verlag."},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"D. N. Turner, P. Wadler, and C. Mossin. Once upon a type. In Proc. of FPCA, La Jolla, 1995.","DOI":"10.1145\/224164.224168"}],"container-title":["Lecture Notes in Computer Science","Programs as Data Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44978-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T01:25:59Z","timestamp":1587777959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44978-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540420682","9783540449782"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44978-7_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}