{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:34:52Z","timestamp":1725467692812},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649250"},{"type":"electronic","value":"9783540683087"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055517","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T20:48:16Z","timestamp":1154033296000},"page":"156-177","source":"Crossref","is-referenced-by-count":2,"title":["Optimal type lifting"],"prefix":"10.1007","author":[{"given":"Bratin","family":"Saha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Shao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"9_CR1","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A. V. Aho","year":"1986","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading, MA, 1986."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"A. W. Appel. Compiling with Continuations. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"9_CR3","unstructured":"N. de Bruijn. A survey of the project AUTOMATH. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 579\u2013606. Edited by J. P. Seldin and J. R. Hindley, Academic Press, 1980."},{"key":"9_CR4","first-page":"237","volume-title":"The essence of compiling with continuations","author":"C. Flanagan","year":"1993","unstructured":"C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In Proc. ACM SIGPLAN \u201993 Conf. on Prog. Lang. Design and Implementation, pages 237\u2013247, New York, June 1993. ACM Press."},{"key":"9_CR5","unstructured":"J. Y. Girard. Interpretation Fonctionnelle et Elimination des Coupures dans l\u2019Arithmetique d\u2019Ordre Superieur. PhD thesis, University of Paris VII, 1972."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/169701.169696","volume":"15","author":"R. Harper","year":"1993","unstructured":"R. Harper and J. C. Mitchell. On the type structure of Standard ML. ACM Trans. Prog. Lang. Syst., 15(2): 211\u2013252, April 1993.","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"9_CR7","first-page":"130","volume-title":"Compiling polymorphism using intensional type analysis","author":"R. Harper","year":"1995","unstructured":"R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Twenty-second Annual ACM Symp. on Principles of Prog. Languages, pages 130\u2013141, New York, Jan 1995. ACM Press."},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"P. Hudak, S. P. Jones, and P. W. et al. Report on the programming language Haskell, a non-strict, purely functional language version 1.2. SIGPLAN Notices, 21(5), May 1992.","DOI":"10.1145\/130697.130699"},{"key":"9_CR9","volume-title":"PhD thesis","author":"R. Hughes","year":"1983","unstructured":"R. Hughes. The design and implementation of programming languages. PhD thesis, Programming Research Group, Oxford University, Oxford, UK, 1983."},{"key":"9_CR10","first-page":"190","volume-title":"Lambda Lifting: Transforming Programs to Recursive Equations","author":"T. Johnsson","year":"1985","unstructured":"T. Johnsson. Lambda Lifting: Transforming Programs to Recursive Equations. In The Second International Conference on Functional Programming Languages and Computer Architecture, pages 190\u2013203, New York, September 1985. Springer-Verlag."},{"key":"9_CR11","series-title":"Technical Monograph PRG-106","volume-title":"PhD thesis","author":"M. P. Jones","year":"1992","unstructured":"M. P. Jones. Qualified Types: Theory and Practice. PhD thesis, Oxford University Computing Laboratory, Oxford, July 1992. Technical Monograph PRG-106."},{"key":"9_CR12","first-page":"287","volume-title":"A theory of qualified types","author":"M. P. Jones","year":"1992","unstructured":"M. P. Jones. A theory of qualified types. In The 4th European Symposium on Programming, pages 287\u2013306, Berlin, February 1992. Spinger-Verlag."},{"key":"9_CR13","unstructured":"M. P. Jones. Dictionary-free overloading by partial evaluation. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, pages 107\u2013117. University of Melbourne TR 94\/9, June 1994."},{"key":"9_CR14","first-page":"177","volume-title":"Longer version available as INRIA Tech Report","author":"X. Leroy","year":"1992","unstructured":"X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth Annual ACM Symp. on Principles of Prog. Languages, pages 177\u2013188, New York, Jan 1992. ACM Press. Longer version available as INRIA Tech Report."},{"key":"9_CR15","first-page":"406","volume-title":"Dynamics in ML","author":"X. Leroy","year":"1991","unstructured":"X. Leroy and M. Mauny. Dynamics in ML. In The Fifth International Conference on Functional Programming Languages and Computer Architecture, pages 406\u2013426, New York, August 1991. Springer-Verlag."},{"key":"9_CR16","volume-title":"The Definition of Standard ML","author":"R. Milner","year":"1990","unstructured":"R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, Cambridge, Massachusetts, 1990."},{"key":"9_CR17","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2319.001.0001","volume-title":"The Definition of Standard ML (Revised)","author":"R. Milner","year":"1997","unstructured":"R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, Cambridge, Massachusetts, 1997."},{"key":"9_CR18","unstructured":"Y. Minamide. Full lifting of type parameters. Technical report, RIMS, Kyoto University, 1997."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"R. Morrison, A. Dearie, R. C. H. Connor, and A. L. Brown. An ad hoc approach to the implementation of polymorphism. ACM Trans. Prog. Lang. Syst., 13(3), July 1991.","DOI":"10.1145\/117009.117017"},{"key":"9_CR20","volume-title":"Technical Report CS-1994-01","author":"G. Nadathur","year":"1994","unstructured":"G. Nadathur. A notation for lambda terms II: Refinements and applications. Technical Report CS-1994-01, Duke University, Durham, NC, January 1994."},{"key":"9_CR21","volume-title":"A compilation method for ML-style polymorphic record calculi","author":"A. Ohori","year":"1992","unstructured":"A. Ohori. A compilation method for ML-style polymorphic record calculi. In Nineteenth Annual ACM Symp. on Principles of Prog. Languages, New York, Jan 1992. ACM Press."},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S0956796800000319","volume":"2","author":"S. P. Jones","year":"1992","unstructured":"S. Peyton Jones. Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine. Journal of Functional Programming, 2(2): 127\u2013202, April 1992.","journal-title":"Journal of Functional Programming"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"S. Peyton Jones. Compiling haskell by program transformation: a report from trenches. In Proceedings of the European Symposium on Programming, Linkoping, April 1996.","DOI":"10.1007\/3-540-61055-3_27"},{"key":"9_CR24","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/spe.4380210505","volume":"21","author":"S. P. Jones","year":"1991","unstructured":"S. Peyton Jones and D. Lester. A modular fully-lazy lambda lifter in haskell. Software \u2014 Practice and Experience, 21: 479\u2013506, 1991.","journal-title":"Software \u2014 Practice and Experience"},{"key":"9_CR25","volume-title":"Let-floating: moving bindings to give faster programs","author":"S. P. Jones","year":"1996","unstructured":"S. Peyton Jones, W. Partain, and A. Santos. Let-floating: moving bindings to give faster programs. In Proc. International Conference on Functional Programming (ICFP\u201996), New York, June 1996. ACM Press."},{"key":"9_CR26","first-page":"408","volume-title":"Lecture Notes in Computer Science, volume 19","author":"J. C. Reynolds","year":"1974","unstructured":"J. C. Reynolds. Towards a theory of type structure. In Proceedings, Colloque sur la Programmation, Lecture Notes in Computer Science, volume 19, pages 408\u2013425. Springer-Verlag, Berlin, 1974."},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Z. Shao. Flexible representation analysis. In Proc. 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP\u201997), pages 85\u201398. ACM Press, June 1997.","DOI":"10.1145\/258948.258958"},{"key":"9_CR28","unstructured":"Z. Shao. An overview of the FLINT\/ML compiler. In Proc. 1997 ACM SIGPLAN Workshop on Types in Compilation, June 1997."},{"key":"9_CR29","volume-title":"Technical Report YALEU\/DCS\/RR-1126","author":"Z. Shao","year":"1997","unstructured":"Z. Shao. Typed cross-module compilation. Technical Report YALEU\/DCS\/RR-1126, Dept. of Computer Science, Yale University, New Haven, CT, November 1997."},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Z. Shao and A. W. Appel. A type-based compiler for Standard ML. In Proc. ACM SIGPLAN \u201995 Conf. on Prog. Lang. Design and Implementation, pages 116\u2013129. ACM Press, 1995.","DOI":"10.1145\/207110.207123"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"D. Tarditi, G. Morrisett, P. Cheng, C. Stone, R. Harper, and P. Lee. TIL: A type-directed optimizing compiler for ML. In Proc. ACM SIGPLAN \u201996 Conf. on Prog. Lang. Design and Implementation, pages 181\u2013192. ACM Press, 1996.","DOI":"10.1145\/231379.231414"},{"key":"9_CR32","first-page":"1","volume-title":"Tag-free garbage collection using explicit type parameters","author":"A. Tolmach","year":"1994","unstructured":"A. Tolmach. Tag-free garbage collection using explicit type parameters. In Proc. 1994 ACM Conf. on Lisp and Functional Programming, pages 1\u201311, New York, June 1994. ACM Press."},{"key":"9_CR33","volume-title":"Technical Report Tech Report TR 93-200","author":"A. K. Wright","year":"1993","unstructured":"A. K. Wright. Polymorphism for imperative languages without imperative types. Technical Report Tech Report TR 93-200, Dept. of Computer Science, Rice University, Houston, Texas, February 1993."}],"container-title":["Lecture Notes in Computer Science","Types in Compilation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T09:07:42Z","timestamp":1555751262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649250","9783540683087"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/bfb0055517","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}