{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:20:25Z","timestamp":1725484825280},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430759"},{"type":"electronic","value":"9783540455752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_19","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T01:30:22Z","timestamp":1180575022000},"page":"191-204","source":"Crossref","is-referenced-by-count":3,"title":["Binding-Time Analysis for Polymorphic Types"],"prefix":"10.1007","author":[{"given":"Rogardt","family":"Heldal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Hughes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"19_CR1","unstructured":"L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. (DIKU report 94\/19)."},{"key":"19_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Automatic autoprojection of higher-order recursion equations","author":"A. Bondorf","year":"1990","unstructured":"A. Bondorf. Automatic autoprojection of higher-order recursion equations. In N. Jones, editor, 3rd European Symposium on Programming, LNCS, Copenhagen, 1990. Springer-Verlag."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"A. Bondorf. Improving binding times without explicit cps-conversion. In 1992 ACM Conference on Lisp and Functional Programming. San Francisco, California, pages 1\u201310, June 1992.","DOI":"10.1145\/141471.141483"},{"key":"19_CR4","unstructured":"C. Consel and P. Jouvelot. Separate Polyvariant Binding-Time Analysis. Technical Report CS\/E 93-006, Oregon Graduate Institute Tech, 1993."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Charles Consel. A tour of schism: a partial evaluation system for higher-order applicative languages. In ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 145\u2013154, June 1993.","DOI":"10.1145\/154630.154645"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"D. Dussart, R. Heldal, and J. Hughes. Module-Sensitive Program Specialisation. In Conference on Programming Language Design and Implementation, Las Vegas, June 1997. ACM SIGPLAN.","DOI":"10.1145\/258915.258934"},{"key":"19_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-60360-3_36","volume-title":"Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time","author":"D. Dussart","year":"1995","unstructured":"D. Dussart, F. Henglein, and C. Mossin. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. In Alan Mycroft, editor, SAS\u201995: 2nd Int\u2019l Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 118\u2013135, Glasgow, Scotland, September 1995. Springer-Verlag."},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-44978-7_4","volume-title":"Boolean constraints for binding-time analysis","author":"K. Glynn","year":"2001","unstructured":"Kevin Glynn, Peter J. Stuckey, Martin Sulzmann, and Harald S\u00f6nderg\u00e5rd. Boolean constraints for binding-time analysis. In Olivier Danvy and Andrzej Filinski, editors, Second Symposium on Programs as Data Objects, volume 2053 of LNCS, pages 39\u201362, Aarhus, May 2001. Springer-Verlag."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"R. Heldal and J. Hughes. Partial Evaluation and Separate Compilation. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Amsterdam, June 1997. ACM SIGPLAN.","DOI":"10.1145\/258993.258996"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0304-3975(00)00050-5","volume":"248","author":"R. Heldal","year":"2000","unstructured":"R. Heldal and J. Hughes. Extending a partial evaluator which supports separate compilation. Theoretical Computer Science 248, pages 99\u2013145, 2000.","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","unstructured":"Rogardt Heldal. The Treatment of Polymorphism and Modules in a Partial Evaluator. PhD thesis, Chalmers University of Technology, April 2001."},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3540543961_22","volume-title":"Efficient type inference for higher-order binding-time analysis","author":"F. Henglein","year":"1991","unstructured":"F. Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor, FPCA, pages 448\u2013472. 5th ACM Conference, Cambridge, MA, USA, Springer-Verlag, August 1991. Lecture Notes in Computer Science, Vol. 523."},{"key":"19_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-57880-3_19","volume-title":"Polymorphic Binding-Time Analysis","author":"F. Henglein","year":"1994","unstructured":"F. Henglein and C. Mossin. Polymorphic Binding-Time Analysis. In D. Sannella, editor, ESOP\u201994: European Symposium on Programming, volume 788 of Lecture Notes in Computer Science, pages 287\u2013301. Springer-Verlag, April 1994."},{"key":"19_CR14","unstructured":"N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993."},{"key":"19_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-61580-6_11","volume-title":"Partial Evaluation","author":"N. D. Jones","year":"1996","unstructured":"Neil D. Jones. What not to do when writing an interpreter for specialisation. In Olivier Danvy, Robert Gl\u00fcck, and Peter Thiemann, editors, Partial Evaluation, volume 1110 of Lecture Notes in Computer Science, pages 216\u2013237. Springer-Verlag, 1996."},{"key":"19_CR16","unstructured":"Simon Peyton Jones, John Hughes, (editors), Lennart Augustsson, Dave Barton, Brian Boutel, Warren Burton, Joseph Fasel, Kevin Hammond, Ralf Hinze, Paul Hudak, Thomas Johnsson, Mark Jones, John Launchbury, Erik Meijer, John Peterson, Alastair Reid, Colin Runciman, and Philip Wadler. Report on the Programming Language Haskell 98, a Non-strict, Purely Functional Language. Available from http:\/\/haskell.org , February 1999."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"J. Launchbury. Projection Factorisations in Partial Evaluation (PhD thesis), volume 1 of Distinguished Dissertations in Computer Science. Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511569814"},{"key":"19_CR18","unstructured":"K. Malmkj\u00e6r, N. Heintze, and O. Danvy. ML partial evaluation using set-based analysis. In Workshop on ML and its Applications, pages 112\u2013119. ACM SIGPLAN, 1994."},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and Systems Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.","DOI":"10.7551\/mitpress\/2319.001.0001"},{"key":"19_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-50940-2_43","volume-title":"Theory and Practice of Software Development","author":"T. \u00c6. Mogensen","year":"1989","unstructured":"T. \u00c6. Mogensen. Binding Time Analysis for Polymorphically Typed Higher Order Languages. In Theory and Practice of Software Development, volume 352 of Lecture Notes in Computer Science, pages 298\u2013312. Springer-Verlag, March 1989."},{"key":"19_CR22","unstructured":"Zoltan Somogyi, Fergus Henderson, and Thomas Conway. Mercury: an efficient purely declarative logic programming language. In Proceedings of the Australian Computer Science Conference, pages 499\u2013512, Glenelg, Australia, February 1995."},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"P. Wadler and S. Blott. How to make ad hoc polymorphism less ad hoc. In Proceedings 1989 Symposium Principles of Programming Languages, pages 60\u201376, Austin, Texas, 1989.","DOI":"10.1145\/75277.75283"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T13:35:05Z","timestamp":1556458505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}