{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:23Z","timestamp":1742598623325,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_220","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:12:21Z","timestamp":1330276341000},"page":"561-574","source":"Crossref","is-referenced-by-count":1,"title":["Comparing flow-based binding-time analyses"],"prefix":"10.1007","author":[{"given":"Jens","family":"Palsberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"37_CR1","unstructured":"Henk P. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, 1981."},{"issue":"1\u20133","key":"37_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0167-6423(91)90035-V","volume":"17","author":"A. Bondorf","year":"1991","unstructured":"Anders Bondorf. Automatic autoprojection of higher order recursive equations. Science of Computer Programming, 17(1\u20133):3\u201334, December 1991.","journal-title":"Science of Computer Programming"},{"issue":"3","key":"37_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1017\/S0956796800000769","volume":"3","author":"A. Bondorf","year":"1993","unstructured":"Anders Bondorf and Jesper J\u00f8rgensen. Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming, 3(3):315\u2013346, 1993.","journal-title":"Journal of Functional Programming"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Charles Consel. Binding time analysis for higher order untyped functional languages. In Proc. ACM Conference on Lisp and Functional Programming, pages 264\u2013272, 1990.","DOI":"10.1145\/91556.91668"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Carsten K. Gomard. Partial type inference for untyped functional programs. In Proc. ACM Conference on Lisp and Functional Programming, pages 282\u2013287, 1990.","DOI":"10.1145\/91556.91672"},{"key":"37_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6423(88)90025-1","volume":"10","author":"H. R. Nielson","year":"1988","unstructured":"Hanne R. Nielson and Flemming Nielson. Automatic binding time analysis for a typed \u03bb-calculus. Science of Computer Programming, 10:139\u2013176, 1988.","journal-title":"Science of Computer Programming"},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Jens Palsberg. Closure analysis in constraint form. ACM Transactions on Programming Languages and Systems. To appear. Also in Proc. CAAP'94, Colloquium on Trees in Algebra and Programming, Springer-Verlag (LNCS 787), pages 276\u2013290, Edinburgh, Scotland, April 1994.","DOI":"10.1007\/BFb0017488"},{"issue":"3","key":"37_CR8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1017\/S0956796800000770","volume":"3","author":"J. Palsberg","year":"1993","unstructured":"Jens Palsberg. Correctness of binding-time analysis. Journal of Functional Programming, 3(3):347\u2013363, 1993.","journal-title":"Journal of Functional Programming"},{"key":"37_CR9","unstructured":"Jens Palsberg and Michael I. Schwartzbach. Safety analysis versus type inference. Information and Computation. To appear."},{"key":"37_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(92)90196-3","volume":"43","author":"J. Palsberg","year":"1992","unstructured":"Jens Palsberg and Michael I. Schwartzbach. Safety analysis versus type inference for partial types. Information Processing Letters, 43:175\u2013180, 1992.","journal-title":"Information Processing Letters"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Jens Palsberg and Michael I. Schwartzbach. Binding-time analysis: Abstract interpretation versus type inference. In Proc. ICCL'94, Fifth IEEE International Conference on Computer Languages, pages 289\u2013298, Toulouse, France, May 1994.","DOI":"10.1109\/ICCL.1994.288372"},{"key":"37_CR12","unstructured":"Jens Palsberg and Michael I. Schwartzbach. Object-Oriented Type Systems. John Wiley & Sons, 1994."},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Peter Sestoft. Replacing function parameters by global variables. Master's thesis, DIKU, University of Copenhagen, September 1989.","DOI":"10.1145\/99370.99374"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_220.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:45:15Z","timestamp":1742597115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_220","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}