{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:37:42Z","timestamp":1742971062671,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221524"},{"type":"electronic","value":"9783540259510"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25951-0_7","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T06:46:58Z","timestamp":1280904418000},"page":"189-232","source":"Crossref","is-referenced-by-count":3,"title":["Binding-Time Analysis for Mercury"],"prefix":"10.1007","author":[{"given":"Wim","family":"Vanhoof","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Bruynooghe","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Leuschel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/154630.154636","volume-title":"PEPM 1993","author":"L.O. Andersen","year":"1993","unstructured":"Andersen, L.O.: Binding-time analysis and the taming of C pointers. In: PEPM 1993, pp. 47\u201358. ACM, New York (1993)"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF03037258","volume":"20","author":"K. Asai","year":"2001","unstructured":"Asai, K.: Binding-time analysis for both static and dynamic expressions. New Generation Computing\u00a020(1), 27\u201352 (2001)","journal-title":"New Generation Computing"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Asai, K.: Binding-time analysis for both static and dynamic expressions. In: Static Analysis Symposium, pp. 117\u2013133 (1999)","DOI":"10.1007\/3-540-48294-6_8"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0167-6423(91)90035-V","volume":"17","author":"A. Bondorf","year":"1991","unstructured":"Bondorf, A.: Automatic autoprojection of higher order recursive equations. Science of Computer Programming\u00a017, 3\u201334 (1991)","journal-title":"Science of Computer Programming"},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1017\/S0956796800000769","volume":"3","author":"A. Bondorf","year":"1993","unstructured":"Bondorf, A., J\u00f8rgensen, J.: Efficient analyses for realistic off-line partial evaluation. Journal of Functional Programming\u00a03(3), 315\u2013346 (1993)","journal-title":"Journal of Functional Programming"},{"key":"7_CR6","series-title":"M. Bruynooghe, M. Leuschel, K. Sagonas","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BFb0053561","volume-title":"Programming Languages and Systems","author":"M. Bruynooghe","year":"1998","unstructured":"Bruynooghe, M., Leuschel, M., Sagonas, K.: A polyvariant binding-time analysis for off-line partial deduction. In: Hankin, C. (ed.) ESOP 1998. M. Bruynooghe, M. Leuschel, K. Sagonas, vol.\u00a01381, pp. 27\u201341. Springer, Heidelberg (1998)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/3-540-45575-2_40","volume-title":"Perspectives of System Informatics","author":"M. Bruynooghe","year":"2001","unstructured":"Bruynooghe, M., Vanhoof, W., Codish, M.: Pos(T): Analyzing dependencies in typed logic programs. In: Bj\u00f8rner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol.\u00a02244, pp. 406\u2013420. Springer, Heidelberg (2001)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-45142-0_6","volume-title":"Logic Based Program Synthesis and Transformation","author":"F. Bueno","year":"2001","unstructured":"Bueno, F., de la Banda, M., Hermenegildo, M., Marriott, K., Puebla, G., Stuckey, P.: A model for inter-module analysis and optimizing compilation. In: Lau, K.-K. (ed.) LOPSTR 2000. LNCS, vol.\u00a02042, pp. 64\u201371. Springer, Heidelberg (2001)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1145\/91556.91668","volume-title":"1990 ACM Conference on Lisp and Functional Programming, Nice, France","author":"C. Consel","year":"1990","unstructured":"Consel, C.: Binding time analysis for higher order untyped functional languages. In: 1990 ACM Conference on Lisp and Functional Programming, Nice, France, pp. 264\u2013272. ACM, New York (1990)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/3-540-61580-6_4","volume-title":"Partial Evaluation","author":"C. Consel","year":"1996","unstructured":"Consel, C., et al.: A uniform approach for compile-time and run-time specialization. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01110, pp. 54\u201372. Springer, Heidelberg (1996)"},{"key":"7_CR11","first-page":"242","volume-title":"Proceedings of the International Symposium on Logic Programming","author":"T. Conway","year":"1995","unstructured":"Conway, T., Henderson, F., Somogyi, Z.: Code generation for Mercury. In: Lloyd, J. (ed.) Proceedings of the International Symposium on Logic Programming, pp. 242\u2013256. MIT Press, Cambridge (1995)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/258915.258934","volume-title":"SIGPLAN 1997 Conference on Programming Language Design and Implementation","author":"D. Dussart","year":"1997","unstructured":"Dussart, D., Heldal, R., Hughes, J.: Module-sensitive program specialisation. In: SIGPLAN 1997 Conference on Programming Language Design and Implementation, Las Vegas, June 1997, pp. 206\u2013214. ACM, New York (1997)"},{"issue":"5","key":"7_CR13","first-page":"45","volume":"2","author":"Y. Futamura","year":"1971","unstructured":"Futamura, Y.: Partial evaluation of a computation process \u2014 an approach to a compiler-compiler. Systems, Computers, Controls\u00a02(5), 45\u201350 (1971)","journal-title":"Systems, Computers, Controls"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1007763000430","volume":"10","author":"R. Gl\u00fcck","year":"1997","unstructured":"Gl\u00fcck, R., J\u00f8rgensen, J.: An automatic program generator for multi-level specialization. Lisp and Symbolic Computation\u00a010, 113\u2013158 (1997)","journal-title":"Lisp and Symbolic Computation"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0956796800000058","volume":"1","author":"C.K. Gomard","year":"1991","unstructured":"Gomard, C.K., Jones, N.D.: A partial evaluator for the untyped lambda-calculus. Journal of Functional Programming\u00a01(1), 21\u201369 (1991)","journal-title":"Journal of Functional Programming"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Heintze, N.: Set-based analysis of ML programs. In: ACM Conference on Lisp and Functional Programming, pp. 306\u2013317 (1994)","DOI":"10.1145\/182590.182495"},{"key":"7_CR17","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":"7_CR18","unstructured":"Henglein, F.: Simple closure analysis. Technical Report D-193, DIKU Semantics Report (1992)"},{"key":"7_CR19","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":"7_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/258993.259005","volume-title":"PEPM 1997","author":"L. Hornof","year":"1997","unstructured":"Hornof, L., Noy\u00e9, J.: Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity. In: PEPM 1997, pp. 63\u201373. ACM, New York (1997)"},{"issue":"2 &3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"Jacobs, D., Langen, A.: Static analysis of logic programs for independent AND-parallelism. Journal of Logic Programming\u00a013(2 &3), 291\u2013314 (1992)","journal-title":"Journal of Logic Programming"},{"issue":"2&3","key":"7_CR22","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1992","unstructured":"Janssens, G., Bruynooghe, M.: Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming\u00a013(2&3), 205\u2013258 (1992)","journal-title":"Journal of Logic Programming"},{"key":"7_CR23","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3-540-15976-2_6","volume-title":"Rewriting Techniques and Applications","author":"N.D. Jones","year":"1985","unstructured":"Jones, N.D., Sestoft, P., S\u00f8ndergaard, H.: An experiment in partial evaluation: The generation of a compiler generator. In: Jouannaud, J.-P. (ed.) RTA 1985. LNCS, vol.\u00a0202, pp. 124\u2013140. Springer, Heidelberg (1985)"},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-61580-6_12","volume-title":"Partial Evaluation","author":"J. J\u00f8rgensen","year":"1996","unstructured":"J\u00f8rgensen, J., Leuschel, M.: Efficiently generating efficient generating extensions in Prolog. In: Danvy, O., Thiemann, P., Gl\u00fcck, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol.\u00a01110, pp. 238\u2013262. Springer, Heidelberg (1996)"},{"key":"7_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-24599-5_18","volume-title":"Logic Programming","author":"V. Lagoon","year":"2003","unstructured":"Lagoon, V., Mesnard, F., Stuckey, P.: Termination analysis with types is more accurate. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 254\u2013268. Springer, Heidelberg (2003)"},{"key":"7_CR27","first-page":"202","volume-title":"Proceedings of the 1991 International Symposium on Logic Programming (ISLP 1991)","author":"T.K. Lakshman","year":"1991","unstructured":"Lakshman, T.K., Reddy, U.S.: Typed Prolog: A semantic reconstruction of the Mycroft-O\u2019Keefe type system. In: Saraswat, K., Ueda, V. (eds.) Proceedings of the 1991 International Symposium on Logic Programming (ISLP 1991), San Diego, CA, pp. 202\u2013220. MIT Press, Cambridge (1991)"},{"key":"7_CR28","first-page":"238","volume-title":"Functional Programming","author":"J. Launchbury","year":"1989","unstructured":"Launchbury, J.: Dependent sums express separation of binding times. In: Davis, K., Hughes, J. (eds.) Functional Programming, Glasgow, Scotland, pp. 238\u2013253. Springer, Heidelberg (1989\/1990)"},{"key":"7_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-540-25951-0_11","volume-title":"Program Development in Computational Logic","author":"M. Leuschel","year":"2004","unstructured":"Leuschel, M., Craig, S.J., Bruynooghe, M., Vanhoof, W.: Specializing interpreters using offline partial deduction. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 340\u2013375. Springer, Heidelberg (2004)"},{"issue":"1","key":"7_CR30","first-page":"139","volume":"4","author":"M. Leuschel","year":"2002","unstructured":"Leuschel, M., J\u00f8rgensen, J., Vanhoof, W., Bruynooghem, M.: Offline specialisation in Prolog using a hand-written compiler generator. Theory and Practice of Logic Programming\u00a04(1), 139\u2013191 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF03037396","volume":"5","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Declarative error diagnosis. New Generation Computing\u00a05, 133\u2013154 (1987)","journal-title":"New Generation Computing"},{"key":"7_CR32","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. Mogensen","year":"1989","unstructured":"Mogensen, T.: Binding Time Analysis for Polymorphically Typed Higher Order Languages. In: D\u00edaz, J., Orejas, F. (eds.) TAPSOFT 1989 and CCIPL 1989. LNCS, vol.\u00a0352, pp. 298\u2013312. Springer, Heidelberg (1989)"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","first-page":"214","volume-title":"Logic Based Program Synthesis and Transformation","author":"T. Mogensen","year":"2003","unstructured":"Mogensen, T., Bondorf, A.: Logimix: A self-applicable partial evaluator for Prolog. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 214\u2013227. Springer, Heidelberg (2003)"},{"issue":"3","key":"7_CR34","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"Mycroft, A., O\u2019Keefe, R.A.: A polymorphic type system for Prolog. Artificial Intelligence\u00a023(3), 295\u2013307 (1984)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"7_CR35","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/200994.201001","volume":"17","author":"J. Palsberg","year":"1995","unstructured":"Palsberg, J.: Closure analysis in constraint form. ACM Transactions on Programming Languages and Systems\u00a017(1), 47\u201362 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Puebla, G., Hermenegildo, M.: Some issues in analysis and specialization of modular Ciao-Prolog programs. In: Leuschel, M. (ed.) Proceedings of the Workshop on Optimization and Implementation of Declarative Languages, Las Cruces. Electronic Notes in Theoretical Computer Science, vol.\u00a030(2), Elsevier Science, Amsterdam (1999)","DOI":"10.1016\/S1571-0661(05)80637-1"},{"key":"7_CR37","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45653-8_19","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J.-G. Smaus","year":"2001","unstructured":"Smaus, J.-G.: Analysis of polymorphically typed logic programs using ACIunification. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 280\u2013295. Springer, Heidelberg (2001)"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Smaus, J.-G., Hill, P.M., King, A.: Mode Analysis Domains for Typed Logic Programs. In: Logic Program Synthesis and Transformation, pp. 82\u2013101 (1999)","DOI":"10.1007\/10720327_6"},{"key":"7_CR39","unstructured":"Somogyi, Z.: A system of precise modes for logic programs. In: International Conference on Logic Programming, pp. 769\u2013787 (1987)"},{"key":"7_CR40","unstructured":"Somogyi, Z., et al.: The Melbourne Mercury compiler, release 0.9"},{"key":"7_CR41","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The implementation of Mercury, an efficient purely declarative logic programming language. In: Proceedings of the ILPS 1994 Postconference Workshop on Implementation Techniques for Logic Programming Languages (1994)"},{"key":"7_CR42","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: Logic programming for the real world. In: Proceedings of the ILPS 1995 Postconference Workshop on Visions for the Future of Logic Programming (1995)"},{"issue":"1-3","key":"7_CR43","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming\u00a029(1-3), 17\u201364 (1996)","journal-title":"Journal of Logic Programming"},{"key":"7_CR44","unstructured":"Somogyi, Z., Henderson, F., Conway, T., Bromage, A., Dowd, T., Jeffery, D., Ross, P., Schachte, P., Taylor, S.: Status of the Mercury system. In: Proceedings of the JICSLP 1996 Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages (1996)"},{"issue":"3","key":"7_CR45","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(94)00021-W","volume":"22","author":"P. Van Hentenryck","year":"1995","unstructured":"Van Hentenryck, P., Cortesi, A., Le Charlier, B.: Type analysis of Prolog using type graphs. Journal of Logic Programming\u00a022(3), 179\u2013209 (1995)","journal-title":"Journal of Logic Programming"},{"key":"7_CR46","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-44404-1_25","volume-title":"Logic for Programming and Automated Reasoning","author":"W. Vanhoof","year":"2000","unstructured":"Vanhoof, W.: Binding-time analysis by constraint solving: a modular and higherorder approach for Mercury. In: Parigot, M., Voronkov, A. (eds.) LPAR 2000. LNCS (LNAI), vol.\u00a01955, pp. 399\u2013416. Springer, Heidelberg (2000)"},{"key":"7_CR47","first-page":"500","volume-title":"16th International Conference on Logic Programming","author":"W. Vanhoof","year":"1999","unstructured":"Vanhoof, W., Bruynooghe, M.: Binding-time analysis for Mercury. In: De Schreye, D. (ed.) 16th International Conference on Logic Programming, pp. 500\u2013514. MIT Press, Cambridge (1999)"},{"key":"7_CR48","unstructured":"Vanhoof, W., Bruynooghe, M.: Binding-time analysis for Mercury. In: Preproceedings of LOPSTR 1999, Venice, Italy, Technical Report, University of Venice (1999)"},{"key":"7_CR49","unstructured":"Vanhoof, W.: Techniques for on- and off-line specialisation of logic programs. Phd, Department of Computer Science, K.U.Leuven, Leuven, Belgium, June 2001, pp : xiv+323+xxxiii (2001)"},{"key":"7_CR50","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/3-540-45653-8_49","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"W. Vanhoof","year":"2001","unstructured":"Vanhoof, W., Bruynooghe, M.: Binding-time annotations without binding-time analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 707\u2013722. Springer, Heidelberg (2001)"},{"key":"7_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45607-4_8","volume-title":"Logic Based Program Synthesis and Transformation","author":"W. Vanhoof","year":"2002","unstructured":"Vanhoof, W., Bruynooghe, M.: When size does matter - Termination analysis for typed logic programs. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 129\u2013147. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Program Development in Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25951-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T14:08:41Z","timestamp":1675087721000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-25951-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221524","9783540259510"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25951-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}