{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:08Z","timestamp":1725551948727},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122507"},{"type":"electronic","value":"9783642122514"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12251-4_8","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T23:32:42Z","timestamp":1270855962000},"page":"87-102","source":"Crossref","is-referenced-by-count":1,"title":["Tag-Free Combinators for Binding-Time Polymorphic Program Generation"],"prefix":"10.1007","author":[{"given":"Peter","family":"Thiemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Sulzmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-58402-1_15","volume-title":"Programming Language Implementation and Logic Programming","author":"L. Birkedal","year":"1994","unstructured":"Birkedal, L., Welinder, M.: Hand-writing program generator generators. In: Hermenegildo, M.V., Penjam, J. (eds.) PLILP 1994. LNCS, vol.\u00a0844, pp. 198\u2013214. Springer, Heidelberg (1994)"},{"key":"8_CR2","unstructured":"Bondorf, A., Dussart, D.: Improving CPS-based partial evaluation: Writing cogen by hand. In: Sestoft, P., S\u00f8ndergaard, H. (eds.) [19], Technical Report 94\/9, Department of Computer Science, pp. 1\u201310"},{"issue":"5","key":"8_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1017\/S0956796809007205","volume":"19","author":"J. Carette","year":"2009","unstructured":"Carette, J., Kiselyov, O., Chieh Shan, C.: Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages. J. Funct. Program.\u00a019(5), 509\u2013543 (2009)","journal-title":"J. Funct. Program."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"De Niel, A., Bevers, E., De Vlaminck, K.: Partial evaluation of polymorphically typed functional languages: the representation problem. In: JTASPEFT\/WSA 1991, pp. 90\u201397 (1991)","DOI":"10.1145\/115865.115880"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-60360-3_36","volume-title":"Static Analysis","author":"D. Dussart","year":"1995","unstructured":"Dussart, D., Henglein, F., Mossin, C.: Polymorphic recursion and subtype qualifications: Polymorphic binding-time analysis in polynomial time. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983, pp. 118\u2013136. Springer, Heidelberg (1995)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44978-7_4","volume-title":"Programs as Data Objects","author":"K. Glynn","year":"2001","unstructured":"Glynn, K., Stuckey, P., Sulzmann, M., S\u00f8ndergaard, H.: Boolean constraints for binding-time analysis. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, pp. 39\u201362. Springer, Heidelberg (2001)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Partial Evaluation. Practice and Theory","year":"1999","unstructured":"Hatcliff, J., Mogensen, T.\u00c6., Thiemann, P. (eds.): DIKU 1998. LNCS, vol.\u00a01706. Springer, Heidelberg (1999)"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/3-540-45575-2_19","volume-title":"Perspectives of System Informatics","author":"R. Heldal","year":"2001","unstructured":"Heldal, R., Hughes, J.: Binding-time analysis for polymorphic types. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, pp. 191\u2013204. Springer, Heidelberg (2001)"},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1011508.1011510","volume":"26","author":"S. Helsen","year":"2004","unstructured":"Helsen, S., Thiemann, P.: Polymorphic specialization for ML. ACM TOPLAS\u00a026(4), 1\u201350 (2004)","journal-title":"ACM TOPLAS"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/3-540-57880-3_19","volume-title":"Programming Languages and Systems - ESOP \u201994","author":"F. Henglein","year":"1994","unstructured":"Henglein, F., Mossin, C.: Polymorphic binding-time analysis. In: Sannella, D. (ed.) ESOP 1994. LNCS, vol.\u00a0788, pp. 287\u2013301. Springer, Heidelberg (1994)"},{"key":"8_CR11","unstructured":"Jones, M.P.: Partial evaluation for dictionary-free overloading. In: Sestoft, P., S\u00f8ndergaard, H. (eds.) [19], pp.\u00a0107\u2013118. Technical Report 94\/9, Department of Computer Science"},{"key":"8_CR12","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N. Jones","year":"1993","unstructured":"Jones, N., Gomard, C., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3540543961_8","volume-title":"Functional Programming Languages and Computer Architecture","author":"J. Launchbury","year":"1991","unstructured":"Launchbury, J.: A strongly-typed self-applicable partial evaluator. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 145\u2013164. Springer, Heidelberg (1991)"},{"key":"8_CR14","unstructured":"Launchbury, J., Holst, C.K.: Handwriting cogen to avoid problems with static typing. In: Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland, pp. 210\u2013218. Glasgow University (1991)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-50940-2_43","volume-title":"TAPSOFT \u201989. Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989","author":"T.\u00c6. Mogensen","year":"1989","unstructured":"Mogensen, T.\u00c6.: Binding time analysis for polymorphically typed higher order languages. In: D\u00edaz, J., Orejas, F. (eds.) CAAP 1989 and TAPSOFT 1989. LNCS, vol.\u00a0351, pp. 298\u2013312. Springer, Heidelberg (1989)"},{"volume-title":"Haskell 98 Language and Libraries, The Revised Report","year":"2003","key":"8_CR16","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries, The Revised Report. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796806006034","volume":"17","author":"S. Peyton Jones","year":"2007","unstructured":"Peyton Jones, S., Vytiniotis, D., Weirich, S., Shields, M.: Practical type inference for arbitrary-rank types. J. Funct. Program.\u00a017(1), 1\u201382 (2007)","journal-title":"J. Funct. Program."},{"key":"8_CR18","first-page":"51","volume-title":"Proc.\u00a0ICFP 2008","author":"T. Schrijvers","year":"2008","unstructured":"Schrijvers, T., Peyton Jones, S.L., Chakravarty, M.M.T., Sulzmann, M.: Type checking with open type functions. In: Thiemann, P. (ed.) Proc.\u00a0ICFP 2008, Victoria, BC, Canada, October 2008, pp. 51\u201362. ACM Press, New York (2008)"},{"key":"8_CR19","unstructured":"Sestoft, P., S\u00f8ndergaard, H. (eds.): Proc. 1994 ACM Workshop Partial Evaluation and Semantics-Based Program Manipulation, Orlando, Fla (June 1994); University of Melbourne, Australia. Technical Report 94\/9, Department of Computer Science"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1145\/232627.232647","volume-title":"Proc. 1996 ICFP","author":"P. Thiemann","year":"1996","unstructured":"Thiemann, P.: Cogen in six lines. In: Dybvig, K. (ed.) Proc. 1996 ICFP, Philadelphia, PA, pp. 180\u2013189. ACM Press, New York (1996)"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Thiemann, P.: Aspects of the PGG system: Specialization for standard Scheme. In: Hatcliff, et al. (eds.) [7], pp. 412\u2013432","DOI":"10.1007\/3-540-47018-2_17"},{"issue":"5","key":"8_CR22","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1017\/S0956796899003469","volume":"9","author":"P. Thiemann","year":"1999","unstructured":"Thiemann, P.: Combinators for program generation. J. Funct. Program.\u00a09(5), 483\u2013525 (1999)","journal-title":"J. Funct. Program."}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12251-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:09:47Z","timestamp":1558289387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12251-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122507","9783642122514"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12251-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}