# Typed Norms for Typed Logic Programs

Martin, Jon and King, Andy (1996) Typed Norms for Typed Logic Programs. In: Gallagher, John, ed. Logic Program Synthesis and Transformation. Lecture Notes in Computer Science, 1207 . Springer-Verlag, pp. 224-238. ISBN 3-540-62718-9. (doi:10.1007/3-540-62718-9_13) (KAR id:21467)

PDF
Language: English
 Preview
Official URL
http://dx.doi.org/10.1007/3-540-62718-9_13

## Abstract

As typed logic programming becomes more mainstream, system building tools like partial deduction systems will need to be mapped from untyped languages to typed ones. It is important, however, when mapping techniques across that the new techniques should exploit the type system as much as possible. in this paper, we show how norms which play a crucial role in termination analysis, can be generated from the prescribed types of a logic program. Interestingly, the types highlight restrictions of earlier norms and suggest how these norms can be extended to obtain some very general and powerful notions of norm which can be used to measure any term in an almost arbitrary way. We see our work on norm derivation as a contribution to the termination analysis of typed logic programs which, in particular, forms an essential part of offline partial deduction systems.

Item Type: Book section 10.1007/3-540-62718-9_13 termination, abstract interpretation Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming, Faculties > Sciences > School of Computing > Theoretical Computing Group Andy King 01 Aug 2009 14:16 UTC 15 Feb 2020 04:02 UTC https://kar.kent.ac.uk/id/eprint/21467 (The current URI for this page, for reference purposes) https://orcid.org/0000-0001-5806-4822
• Depositors only (login required):