{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:45:31Z","timestamp":1725561931804},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212997"},{"type":"electronic","value":"9783540247302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24730-2_22","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:00:15Z","timestamp":1280761215000},"page":"266-279","source":"Crossref","is-referenced-by-count":6,"title":["Binding-Time Analysis for MetaML via Type Inference and Constraint Solving"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Linger","sequence":"first","affiliation":[]},{"given":"Tim","family":"Sheard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3540543961_22","volume-title":"Functional Programming Languages and Computer Architecture","author":"F. Henglein","year":"1991","unstructured":"Henglein, F.: Efficient type inference for higher-order binding-time analysis. In: Hughes, J. (ed.) FPCA 1991. LNCS, vol.\u00a0523, pp. 448\u2013472. Springer, Heidelberg (1991)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/258993.259019","volume-title":"Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM)","author":"W. Taha","year":"1997","unstructured":"Taha, W., Sheard, T.: Multi-stage programming with explicit annotations. In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM), pp. 203\u2013217. ACM Press, New York (1997)"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-44806-3_2","volume-title":"Semantics, Applications, and Implementation of Program Generation","author":"T. Sheard","year":"2001","unstructured":"Sheard, T.: Accomplishments and research challenges in meta-programming. In: Taha, W. (ed.) SAIG 2001. LNCS, vol.\u00a02196, pp. 2\u201344. Springer, Heidelberg (2001)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/581690.581691","volume-title":"ACM SIGPLAN Workshop on Haskell","author":"T. Sheard","year":"2002","unstructured":"Sheard, T., Jones, S.P.: Template meta-programming for haskell. In: ACM SIGPLAN Workshop on Haskell, pp. 1\u201316. ACM Press, New York (2002)"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/568173.568176","volume-title":"Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM)","author":"T. Sheard","year":"2002","unstructured":"Sheard, T., Linger, N.: Search-based binding time analysis using type-directed pruning. In: Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM), pp. 20\u201331. ACM Press, New York (2002)"},{"key":"#cr-split#-22_CR6.1","unstructured":"Jones, M.P.: Qualified Types: Theory and Practice. PhD thesis, Oxford University (1992);"},{"key":"#cr-split#-22_CR6.2","unstructured":"Also available as Programming Research Group technical report 106"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/(SICI)1096-9942(199901\/03)5:1<35::AID-TAPO4>3.0.CO;2-4","volume":"5","author":"M. Odersky","year":"1999","unstructured":"Odersky, M., Sulzmann, M., Wehr, M.: Type inference with constrained types. Theory and Practice of Object Systems\u00a05, 35\u201355 (1999)","journal-title":"Theory and Practice of Object Systems"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/135226.135233","volume":"38","author":"W. Pugh","year":"1992","unstructured":"Pugh, W.: The omega test: A fast and practical integer programming algorithm for dependence analysis. Communications of the ACM\u00a038, 102\u2013114 (1992)","journal-title":"Communications of the ACM"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0167-6423(88)90025-1","volume":"10","author":"H. Nielson","year":"1988","unstructured":"Nielson, H., Nielson, F.: Automatic binding time analysis for a typed \u03bb-calculus. Science of Computer Programming\u00a010, 139\u2013176 (1988)","journal-title":"Science of Computer Programming"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0956796800000058","volume":"1","author":"C. Gomard","year":"1991","unstructured":"Gomard, C., Jones, N.: A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming\u00a01, 21\u201369 (1991)","journal-title":"Journal of Functional Programming"},{"key":"22_CR11","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\u2013201. Springer, Heidelberg (2001)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-62064-8_22","volume-title":"Perspectives of System Informatics","author":"R. Gl\u00fcck","year":"1996","unstructured":"Gl\u00fcck, R., J\u00f8rgensen, J.: Fast binding-time analysis for multi-level specialization. In: Bjorner, D., Broy, M., Pottosin, I.V. (eds.) PSI 1996. LNCS, vol.\u00a01181, pp. 261\u2013272. Springer, Heidelberg (1996)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Davies, R.: A temporal-logic approach to binding-time analysis. In: Proceedings of the 11th Annual Symposium on Logic in Computer Science, pp. 184\u2013195 (1996)","DOI":"10.1109\/LICS.1996.561317"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BFb0026825","volume-title":"Programming Languages: Implementations, Logics and Programs","author":"R. Gl\u00fcck","year":"1995","unstructured":"Gl\u00fcck, R., J\u00f8rgensen, J.: Efficient multi-level generating extensions for program specialization. In: Swierstra, S.D. (ed.) PLILP 1995. LNCS, vol.\u00a0982, pp. 259\u2013278. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24730-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T18:15:18Z","timestamp":1552846518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24730-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212997","9783540247302"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24730-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}