{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:02:53Z","timestamp":1760043773276,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620648"},{"type":"electronic","value":"9783540496373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-62064-8_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:32:49Z","timestamp":1330295569000},"page":"261-272","source":"Crossref","is-referenced-by-count":17,"title":["Fast binding-time analysis for multi-level specialization"],"prefix":"10.1007","author":[{"given":"Robert","family":"Gl\u00fcck","sequence":"first","affiliation":[]},{"given":"Jesper","family":"J\u00f8rgensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"L.O. Andersen. Binding-time analysis and the taming of C pointers. In Partial Evaluation and Semantics-Based Program Manipulation, ACM Press, 1993.","DOI":"10.1145\/154630.154636"},{"issue":"3","key":"22_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01019003","volume":"8","author":"L. Birkedal","year":"1995","unstructured":"L. Birkedal, M. Welinder. Binding-time analysis for Standard ML. Lisp and Symbolic Computation, 8(3): 191\u2013208, 1995.","journal-title":"Lisp and Symbolic Computation"},{"issue":"1-3","key":"22_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0167-6423(91)90035-V","volume":"17","author":"A. Bondorf","year":"1991","unstructured":"A. Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17(1-3):3\u201334, 1991.","journal-title":"Science of Computer Programming"},{"issue":"3","key":"22_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/S0956796800000769","volume":"3","author":"A. Bondorf","year":"1993","unstructured":"A. Bondorf, J. J\u00f8rgensen. Efficient analyses for realistic off-line partial evaluation. J of Functional Programming, 3(3):315\u2013346, 1993.","journal-title":"J of Functional Programming"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"C. Consel. Binding time analysis for higher order untyped functional languages. In Conference on Lisp and Functional Languages. 264\u2013272, ACM Press, 1990.","DOI":"10.1145\/91556.91668"},{"key":"22_CR6","unstructured":"A. P. Ershov. On the essence of compilation. In E. J. Neuhold (ed.), Formal Description of Programming Concepts, 391\u2013420. North-Holland, 1978."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"R. Gl\u00fcck, J. J\u00f8rgensen. Generating optimizing specializers. In IEEE International Conference on Computer Languages, 183\u2013194. 1994.","DOI":"10.1109\/ICCL.1994.288382"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"R. Gl\u00fcck, J. J\u00f8rgensen. Efficient multi-level generating extensions for program specialization. In M. Hermenegildo, S. D. Swierstra (eds.) Programming Languages, Implementations, Logics and Programs, LNCS 982, 259\u2013278, Springer-Verlag, 1995.","DOI":"10.1007\/BFb0026808"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"C. K. Gomard. Partial type inference for untyped functional programs. In ACM Conference on Lisp and Functional Programming, 282\u2013287, ACM Press, 1990.","DOI":"10.1145\/91556.91672"},{"issue":"1","key":"22_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0956796800000058","volume":"1","author":"C. K. Gomard","year":"1991","unstructured":"C. K. Gomard, N. D. Jones. A partial evaluator for the untyped lambda calculus. J of Functional Programming, 1(1):21\u201369, 1991.","journal-title":"J of Functional Programming"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"F. Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes (ed.), Functional Programming and Computer Architecture, LNCS 523, 448\u2013472, Springer-Verlag, 1991.","DOI":"10.1007\/3540543961_22"},{"key":"22_CR12","unstructured":"IEEE. Standard for the Scheme programming language, IEEE Std 1178-1990."},{"key":"22_CR13","unstructured":"N. D. Jones, C. K. Gomard, P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"J. J\u00f8rgensen. Generating a compiler for a lazy language by partial evaluation. In Symposium on Principles of Programming Languages. 258\u2013268, 1992.","DOI":"10.1145\/143165.143220"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"F. Nielson, H. R. Nielson. Two-Level Functional Languages, volume 34 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511526572"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"F. Nielson, H. R. Nielson. Multi-level lambda-calculus: an algebraic description. In O. Danvy, R. Gl\u00fcck, P. Thiemann (eds.), Partial Evaluation. LNCS 1110, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61580-6_17"},{"issue":"4","key":"22_CR17","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/210184.210187","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"J. Palsberg, P. O'Keefe. A type system equivalent to flow analysis. TOPLAS, 17(4):576\u2013599, 1995.","journal-title":"TOPLAS"},{"key":"22_CR18","volume-title":"Master's thesis","author":"J. Rehof","year":"1995","unstructured":"J. Rehof. Polymorphic dynamic typing. Master's thesis, Univ. of Copenhagen, Denmark, 1995."},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"R. Tarjan. Data Structures and Network Flow Algorithms, vol. CMBS 44 of Regional Conference Series in Applied Mathematics. SIAM, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"P. Thiemann. Cogen in six lines. In International Conference on Functional Programming. 180\u2013189, ACM Press, 1996.","DOI":"10.1145\/232627.232647"},{"issue":"3","key":"22_CR21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1017\/S0956796800000782","volume":"3","author":"M. Wand","year":"1993","unstructured":"M. Wand. Specifying the correctness of binding-time analysis. J of Functional Programming, 3(3):365\u2013387, 1993.","journal-title":"J of Functional Programming"}],"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-62064-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:27:44Z","timestamp":1742599664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62064-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620648","9783540496373"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-62064-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}