{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:26Z","timestamp":1725665006137},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540627180"},{"type":"electronic","value":"9783540684947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62718-9_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:49:03Z","timestamp":1330296543000},"page":"224-238","source":"Crossref","is-referenced-by-count":6,"title":["Typed norms for typed logic programs"],"prefix":"10.1007","author":[{"given":"Jonathan C.","family":"Martin","sequence":"first","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Soper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"13_CR1","first-page":"150","volume-title":"Studies in pure Prolog: Termination","author":"K.R. Apt","year":"1990","unstructured":"K.R. Apt and D. Pedreschi. Studies in pure Prolog: Termination. In Proceedings Esprit symposium on computational logic, pages 150\u2013176, Brussels, November 1990. Springer-Verlag."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"F. Benoy and A. King. Inferring argument size relations with CLP( $$\\mathcal{R}$$ ). In LOP-STR'96. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-62718-9_12"},{"key":"13_CR3","unstructured":"M. Bezem. Characterizing termination of logic programs with level mappings. In Ewing L. Lusk and Ross A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, pages 69\u201380, Cleveland, Ohio, USA, 1989."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"A. Bossi, N. Cocco, and M. Fabris. Typed norms. In ESOP'92, pages 73\u201392, 1992.","DOI":"10.1007\/3-540-55253-7_5"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(92)00019-N","volume":"124","author":"A. Bossi","year":"1994","unstructured":"A. Bossi, N. Cocco, and M. Fabris. Norms on terms and their use in proving universal termination of a logic program. Theoretical Computer Science, 124:297\u2013328, 1994.","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","unstructured":"S. Decorte, D. de Schreye, and M. Fabris. Automatic inference of norms: A missing link in automatic termination analysis. In ILPS'93, pages 420\u2013436, 1993."},{"key":"13_CR7","unstructured":"S. Decorte, D. de Schreye, and M. Fabris. Exploiting the power of typed norms in automatic inference of interargument relations. Technical report, Dept. computer science, K.U.Leuven, 1994."},{"key":"13_CR8","unstructured":"J. Gallagher and A. de Waal. Fast and precise regular approximations of logic programs. In ICLP'94, pages 599\u2013613, 1994."},{"key":"13_CR9","unstructured":"C. Gurr. A Self-Applicable Partial Evaluator for the Logic Programming Language G\u00f6del. PhD thesis, University of Bristol, January 1994."},{"key":"13_CR10","unstructured":"C. Gurr. Personal communication on the literature on termination analyses. September 1995."},{"key":"13_CR11","unstructured":"P. M. Hill and J. W. Lloyd. The G\u00f6del Programming Language. MIT Press, 1994."},{"key":"13_CR12","doi-asserted-by":"crossref","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. J. Logic Programming, 13:205\u2013258, 1992.","journal-title":"J. Logic Programming"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"L. Pl\u00fcmer. Termination Proofs for Logic Programs. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type Analysis of Prolog Using Type Graphs. In PLDI'94, pages 337\u2013348. ACM Press, 1994.","DOI":"10.1145\/178243.178479"},{"key":"13_CR15","volume-title":"Master's thesis","author":"P. Roy Van","year":"1984","unstructured":"P. Van Roy. A Prolog Compiler for the PLM. Master's thesis, Computer Science Division, University of California, Berkeley, 1984."}],"container-title":["Lecture Notes in Computer Science","Logic Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62718-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:08Z","timestamp":1605647648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62718-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540627180","9783540684947"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-62718-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}