{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T20:40:12Z","timestamp":1737060012877,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540419198"},{"type":"electronic","value":"9783540453611"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45361-x_9","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T00:42:57Z","timestamp":1180572177000},"page":"140-157","source":"Crossref","is-referenced-by-count":4,"title":["A Usage Analysis with Bounded Usage Polymorphism and Subtyping"],"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,10]]},"reference":[{"key":"9_CR1","series-title":"Lect Notes Comput Sci","volume-title":"The grin project:A highly optimising back end for lazy functional languages","author":"U. Boquist","year":"1997","unstructured":"U. Boquist and T. Johnsson. The grin project:A highly optimising back end for lazy functional languages. In Proc. of IFL\u2019 96, Bad Godesberg, Germany. Springer Verlag LNCS 1268, 1996."},{"key":"9_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":"9_CR3","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":"9_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/3-540-60360-3_37","volume-title":"Optimizing lazy functional programs using flow inference","author":"K.-F. Fax\u00e9n","year":"1995","unstructured":"Karl-Filip Fax\u00e9n. Optimizing lazy functional programs using flow inference. In Proc.of SAS\u2019 95, pages 136\u2013153. Springer-Verlag, LNCS 983, September 1995."},{"key":"9_CR5","unstructured":"Karl-Filip Fax\u00e9n. Analysing, Transforming and Compiling Lazy Functional Programs. PhD thesis, Royal Institute of Technology, Sweden, June 1997."},{"key":"9_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-18317-5_3","volume-title":"TIM: A Simple, Lazy Abstract Machine to Execute Supercombinators","author":"J. Fairbairn","year":"1987","unstructured":"J. Fairbairn and S. Wray. TIM: A Simple, Lazy Abstract Machine to Execute Supercombinators. In Proc. of FPCA\u2019 87, pages 34\u201345. Springer Verlag LNCS 274, September 1987."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"J. Gustavsson and D. Sands. A foundation for space-safe transformations of call-by-need programs. In Proc.of HOOTS\u2019 99, volume 26 of ENTCS. Elsevier, 1999.","DOI":"10.1016\/S1571-0661(05)80284-1"},{"key":"9_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Constrain abstractions","author":"J. Gustavsson","year":"2001","unstructured":"J. Gustavsson and J. Svenningsson. Constrain abstractions. In Proc.of Second Symposium on Programs as Data Objects, LNCS.Springer Verlag, 2001.To Appear."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"J. Gustavsson. A Type Based Sharing Analysis for Update Avoidance and Optimisation. In Proc.of CFP\u2019 98, pages 39\u201350, Baltimore, Maryland, September 1998.","DOI":"10.1145\/289423.289427"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"J. Gustavsson. A Type Based Sharing Analysis for Update Avoidance and Optimisation. Licentiate thesis, May 1999.","DOI":"10.1145\/289423.289427"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"J. Launchbury. A Natural Semantics for Lazy Evaluation. In Proc. of POPL\u2019 93, Charleston, N.Carolina, 1993.","DOI":"10.1145\/158511.158618"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"J. Launchbury, A. Gill, J. Hughes, S. Marlow, S.L. Peyton Jones, and P. Wadler. Avoiding Unnecessary Updates. In J. Launchbury and P.M. Sansom,editors, Functional Programming, Workshops in Computing, Glasgow, 1992.","DOI":"10.1007\/978-1-4471-3215-8_13"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"S. Marlow.Update Avoidance Analysis by Abstract Interpretation. In Proc. 1993 Glasgow Workshop on Functional Programming, Workshops in Computing. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4471-3236-3_14"},{"key":"9_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0055427","volume-title":"Types for 0,1 or many uses","author":"T. Mogensen","year":"1998","unstructured":"T. Mogensen. Types for 0,1 or many uses. In Proc.of IFL\u2019 97, pages 112\u2013122. Springer-Verlag, LNCS 1467, September 1997."},{"key":"9_CR16","unstructured":"C. Mossin. Flow Analysis of Typed Higher-Order Programs (Revised Version). PhD thesis, University of Copenhagen, Denmark, August 1997."},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S. L. Jones Peyton","year":"1992","unstructured":"Simon L. Peyton Jones. Implementing lazy functional languages on stock hardware:the spineless tagless g-machine. Journal of Functional Programming, 2(2):127\u2013202, July 1992.","journal-title":"Journal of Functional Programming"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones, W. Partain, and A. Santos. Let-floating: moving bindings to give faster programs. In Proc.of CFP\u2019 96, pages 1\u201312. ACM, May 1996.","DOI":"10.1145\/232627.232630"},{"key":"9_CR19","series-title":"Lect Notes Comput Sci","volume-title":"Non-determinism analysis in a parallel-functional language","author":"R. Pe\u00f1a","year":"2001","unstructured":"R. Pe\u00f1a and C. Segura. Non-determinism analysis in a parallel-functional language. In Proceedings of the 12th International Workshop of Functional Languages, LNCS, September 2000. Also in this volume."},{"key":"9_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. To appear.","DOI":"10.1145\/360204.360208"},{"key":"9_CR21","unstructured":"P. Sestoft. Analysis and Efficient Implementation of Functional Programs. PhD thesis, DIKU, University of Copenhagen, Denmark, October 1991."},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1017\/S0956796897002712","volume":"7","author":"P. Sestoft","year":"1997","unstructured":"P. Sestoft. Deriving a lazy abstract machine. Journal of Functional Programming, 7(3):231\u2013264, May 1997.","journal-title":"Journal of Functional Programming"},{"key":"9_CR23","unstructured":"Josef Svenningsson. An efficient algorithm for a sharing analysis with polymorphism and subtyping. Masters thesis, June 2000."},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"J.-P. Talpin and P. Jouvelot. The ype and effiect discipline. Information and Computation, 111(2), 1994.","DOI":"10.1006\/inco.1994.1046"},{"key":"9_CR25","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"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Keith Wansbrough and Simon Peyton Jones. Once Upon a Polymorphic Type. Technical Report TR-1998-19, Departmen of Computing Science, University of Glasgow, December 1998.","DOI":"10.1145\/292540.292545"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Keith Wansbrough and Simon Peyton Jones. Once Upon a Polymorphic Type. In Proc.of POPL\u2019 99, January 1999.","DOI":"10.1145\/292540.292545"},{"key":"9_CR28","unstructured":"Keith Wansbrough and Simon Peyton Jones. Simple Usage Polymorphism. In ACM SIGPLAN Workshop on Types in Compilation, September 2000."}],"container-title":["Lecture Notes in Computer Science","Implementation of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45361-X_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T20:10:58Z","timestamp":1737058258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45361-X_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540419198","9783540453611"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-45361-x_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}