Martin, J.C. and King, Andy and Soper, P. (1997) Typed norms for typed logic programs. In: Gallagher, J., ed. Lecture Notes In Computer Science. Springer-Verlag Berlin pp. 224-238. ISBN 3-540-62718-9.
|The full text of this publication is not available from this repository. (Contact us about this Publication)|
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:||Conference or workshop item (Paper)|
|Additional information:||Document Type: Proceedings Paper Conference Information: 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR 96) / 6th Inductive Logic Programming Workshop (ILP 96) Stockholm, Sweden, AUG 28-30, 1996 Network Computat Log; European Commiss, ESPRIT Compulog Net|
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
|Divisions:||Faculties > Science Technology and Medical Studies > School of Computing|
|Depositing User:||M.A. Ziai|
|Date Deposited:||19 Apr 2009 19:45|
|Last Modified:||21 May 2011 23:59|
|Resource URI:||http://kar.kent.ac.uk/id/eprint/18177 (The current URI for this page, for reference purposes)|
- Depositors only (login required):