{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T21:23:00Z","timestamp":1750454580798,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417392"},{"type":"electronic","value":"9783540447160"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44716-4_19","type":"book-chapter","created":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T18:16:34Z","timestamp":1187201794000},"page":"296-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Framework for Analysis of Typed Logic Programs"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Lagoon","sequence":"first","affiliation":[]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,21]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"M. Bruynooghe, G. Janssens, and A. K\u00e5gedal. Live-structure analysis for logic programming languages with declarations. In Procs. 14th ICLP, 33\u201347. MIT Press, 1997.","DOI":"10.7551\/mitpress\/4299.003.0009"},{"issue":"1-2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(98)00122-4","volume":"238","author":"M. Codish","year":"2000","unstructured":"M. Codish and V. Lagoon. Type dependencies for logic programs using ACI unification. Theoretical Computer Science, 238(1-2):131\u2013159, 2000.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0743-1066(99)00007-2","volume":"42","author":"M. Codish","year":"2000","unstructured":"M. Codish, V. Lagoon, and F. Bueno. An algebraic approach to sharing analysis of logic programs. JLP, 42(2):111\u2013149, 2000.","journal-title":"JLP"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM Symp. on Principles of Programming Languages, 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"19_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-48085-3_13","volume-title":"Procs. CP99","author":"B. Demoen","year":"1999","unstructured":"B. Demoen, M. Garcia de la Banda, W. Harvey, K. Marriott, and P. Stuckey. An overview of HAL. In Procs. CP99. LNCS 1713, 174\u2013188, 1999."},{"key":"19_CR6","unstructured":"J. Gallagher and D. Waal. Fast and precise regular approximations of logic programs. In Procs. 11th ICLP, 599\u2013613. MIT Press, 1994."},{"key":"19_CR7","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest, 1984."},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(94)00021-W","volume":"22","author":"P. Van Hentenryck","year":"1995","unstructured":"P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of Prolog using type graphs. JLP, 22(3):179\u2013209, 1995.","journal-title":"JLP"},{"key":"19_CR9","unstructured":"M. V. Hermenegildo and K. J. Greene. &-Prolog and its performance: Exploiting independent And-Parallelism. In Procs. 7th ICLP, 253\u2013268. MIT Press, 1990."},{"key":"19_CR10","unstructured":"P. Hill and J. Lloyd. The G\u00f6del Language. MIT Press, 1994."},{"issue":"2 & 3","key":"19_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0743-1066(92)90034-Z","volume":"13","author":"D. Jacobs","year":"1992","unstructured":"D. Jacobs and A. Langen. Static analysis of logic programs for independent AND parallelism. JLP, 13(2 & 3):291\u2013314, 1992.","journal-title":"JLP"},{"issue":"2 & 3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1992","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. JLP, 13(2 & 3):205\u2013258, 1992.","journal-title":"JLP"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1988.","DOI":"10.1007\/978-3-642-83189-8"},{"issue":"4","key":"19_CR14","first-page":"181","volume":"2","author":"K. Marriott","year":"1993","unstructured":"K. Marriott and H. S\u2205ndergaard. Precise and efficient groundness analysis for logic programs. ACM TOPLAS, 2(4):181\u2013196, 1993.","journal-title":"ACM TOPLAS"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/174662.174664","volume":"16","author":"A. Mulkers","year":"1994","unstructured":"A. Mulkers, W. Winsborough, and M. Bruynooghe. Live-structure dataflow analysis for Prolog. ACM TOPLAS, 16(2):205\u2013258, 1994.","journal-title":"ACM TOPLAS"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft and R.A. O\u2019Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295\u2013307, 1984.","journal-title":"Artificial Intelligence"},{"key":"19_CR18","series-title":"Technical Report","volume-title":"Mode checking using constrained regular trees","author":"L. Naish","year":"1998","unstructured":"L. Naish. Mode checking using constrained regular trees. Technical Report 98\/3, Department of Computer Science, University of Melbourne, Australia, 1998."},{"issue":"1-3","key":"19_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury, an efficient purely declarative logic programming language. JLP, 29(1-3):17\u201364, 1996.","journal-title":"JLP"},{"key":"19_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/3-540-16442-1_25","volume-title":"Procs. ESOP86","author":"H. S\u2205ndergaard","year":"1986","unstructured":"H. S\u2205ndergaard. An application of abstract interpretation of logic programs: Occur check reduction. In Procs. ESOP86, itLNCS 213, 327\u2013338, 1986."}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44716-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T11:50:11Z","timestamp":1708170611000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44716-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417392","9783540447160"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44716-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"21 March 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}