Typed norms for typed logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1207, Issue , 1997, Pages 224-238

  Martin, Jonathan C ^a   King, Andy ^b   Soper, Paul ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC;

LOGIC PROGRAMS; MAPPING TECHNIQUES; PARTIAL DEDUCTION; SYSTEM BUILDING; TERMINATION ANALYSIS; TYPE SYSTEMS;

LOGIC PROGRAMMING;

EID: 84949434198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62718-9_13     Document Type: Conference Paper

References (15)

1. K.R. Apt and D. Pedreschi. Studies in pure Prolog: Termination. In Proceedings Esprit symposium on computational logic, pages 150-176, Brussels, November 1990. Springer-Verlag.
2. F. Benoy and A. King. Inferring argument size relations with CLP(R). In LOP-STR’96. Springer-Verlag, 1996.
3. 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-80, Cleveland, Ohio, USA, 1989.
4. A. Bossi, N. Cocco, and M. Fabris. Typed norms. In ESOP’92, pages 73-92, 1992.
5. 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-328, 1994.
6. S. Decorte, D. de Schreye, and M. Fabris. Automatic inference of norms: A missing link in automatic termination analysis. In ILPS’93, pages 420-436, 1993.
7. 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.
8. J. Gallagher and A. de Waal. Fast and precise regular approximations of logic programs. In ICLP’94, pages 599-613, 1994.
9. C. Gurr. A Self-Applicable Partial Evaluator for the Logic Programming Language Gödel. PhD thesis, University of Bristol, January 1994.
10. C. Gurr. Personal communication on the literature on termination analyses. September 1995.
11. P. M. Hill and J. W. Lloyd. The Gödel Programming Language. MIT Press, 1994.
12. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. J. Logic Programming, 13:205-258, 1992.
13. L. Plümer. Termination Proofs for Logic Programs. Springer-Verlag, 1990.
14. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type Analysis of Prolog Using Type Graphs. In PLDI’94, pages 337-348. ACM Press, 1994.
15. P. Van Roy. A Prolog Compiler for the PLM. Master’s thesis, Computer Science Division, University of California, Berkeley, 1984.