{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T23:10:15Z","timestamp":1784848215976,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540285847","type":"print"},{"value":"9783540319719","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11547662_5","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:36:20Z","timestamp":1127831780000},"page":"35-51","source":"Crossref","is-referenced-by-count":14,"title":["Inference of Well-Typings for Logic Programs with Application to Termination Analysis"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Bruynooghe","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Gallagher","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wouter","family":"Van Humbeeck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. Draft (2004)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-45789-5_33","volume-title":"Static Analysis","author":"M. Bruynooghe","year":"2002","unstructured":"Bruynooghe, M., Codish, M., Genaim, S., Vanhoof, W.: Reuse of results in termination analysis of typed logic programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 477\u2013492. Springer, Heidelberg (2002)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., Gallagher, J., Van Humbeeck, W.: Inference of well-typings for logic programs with application to termination analysis. Technical Report CW 409, Dept. Comp. Sc., Katholieke Universiteit Leuven (2005)","DOI":"10.1007\/11547662_5"},{"key":"5_CR4","unstructured":"Christiansen, H.: Deriving declarations from programs (extended abstract). In: CPP 1997, Workshop on Constraint Programming for Reasoning about Programming, Leeds (1997)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T., Shapiro, E., Vardi, M., Yardeni, E.: Logic programs as types for logic programs. In: Logic in Computer Science, LICS 1991, pp. 300\u2013309 (1991)","DOI":"10.1109\/LICS.1991.151654"},{"key":"5_CR6","unstructured":"Gallagher, J.P., de Waal, D.: Fast and precise regular approximation of logic programs. In: Logic Programming, ICLP 1994, pp. 599\u2013613 (1994)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45587-6_16","volume-title":"Practical Aspects of Declarative Languages","author":"J.P. Gallagher","year":"2002","unstructured":"Gallagher, J.P., Puebla, G.: Abstract interpretation over non-deterministic finite tree automata for set-based analysis of logic programs. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257, pp. 243\u2013261. Springer, Heidelberg (2002)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-47813-2_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Genaim","year":"2002","unstructured":"Genaim, S., Codish, M., Gallagher, J.P., Lagoon, V.: Combining norms to prove termination. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 126\u2013138. Springer, Heidelberg (2002)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Heintze, N., Jaffar, J.: A finite presentation theorem for approximating logic programs. In: Principles of Programming Languages, POPL 1990, pp. 197\u2013209 (1990)","DOI":"10.1145\/96709.96729"},{"key":"5_CR10","first-page":"1","volume-title":"Types in Logic Programming","author":"P.M. Hill","year":"1992","unstructured":"Hill, P.M., Topor, R.W.: A semantics for typed logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 1\u201362. MIT Press, Cambridge (1992)"},{"issue":"2-3","key":"5_CR11","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":"5_CR12","doi-asserted-by":"crossref","unstructured":"Jones, N.D., Muchnick, S.S.: A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In: Principles of Programming Languages, POPL 1982, pp. 66\u201374 (1982)","DOI":"10.1145\/582153.582161"},{"key":"5_CR13","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.J.: Termination analysis with types is more accurate. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 254\u2013268. Springer, Heidelberg (2003)"},{"key":"5_CR14","unstructured":"Lakshman, T.L., Reddy, U.S.: Typed Prolog: A semantic reconstruction of the Mycroft-O\u2019Keefe type system. In: Logic Programming, ISLP 1991, pp. 202\u2013217 (1991)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Marlow, S., Wadler, P.: A practical subtyping system for Erlang. In: ICFP, pp. 136\u2013149 (1997)","DOI":"10.1145\/258948.258962"},{"key":"5_CR16","unstructured":"Mishra, P.: Towards a theory of types in Prolog. In: Logic Programming, ISLP 1984, pp. 289\u2013298 (1984)"},{"issue":"3","key":"5_CR17","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"},{"key":"5_CR18","unstructured":"Reynolds, J.C.: Automatic construction of data set definitions. In: Processing Information, vol. 68, pp. 456\u2013461 (1996)"},{"issue":"1-3","key":"5_CR19","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":"5_CR20","unstructured":"Taboch, C., Genaim, S., Codish, M.: TerminWeb: Semantic based termination analyser for logic programs (2002), http:\/\/www.cs.bgu.ac.il\/~mcodish\/TerminWeb."},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. Journal of the ACM\u00a031(2), 245\u2013281 (1984)","journal-title":"Journal of the ACM"},{"issue":"3","key":"5_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(94)00021-W","volume":"22","author":"P. Hentenryck Van","year":"1994","unstructured":"Van Hentenryck, P., Cortesi, A., Le Charlier, B.: Type analysis of Prolog using type graphs. Journal of Logic Programming\u00a022(3), 179\u2013210 (1994)","journal-title":"Journal of Logic Programming"},{"key":"5_CR23","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. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 129\u2013147. Springer, Heidelberg (2002)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Vaucheret, C., Bueno, F.: More precise yet efficient type inference for logic programs. In: Static Analysis, SAS 2002, pp. 102\u2013116 (2002)","DOI":"10.1007\/3-540-45789-5_10"},{"key":"5_CR25","unstructured":"Zobel, J.: Derivation of polymorphic types for Prolog programs. In: Logic Programming, ICLP 1987, pp. 817\u2013838 (1987)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11547662_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:55:43Z","timestamp":1736006143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11547662_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285847","9783540319719"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11547662_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}