Termination and reduction checking for higher-order logic programs

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

Volumn 2083 LNAI, Issue , 2001, Pages 401-415

  Pientka, Brigitte ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; COMPUTATION THEORY; RECONFIGURABLE HARDWARE; SEMANTICS;

DEDUCTIVE SYSTEMS; HIGHER ORDER LOGIC; HIGHER-ORDER; INFERENCE SYSTEMS; INPUT AND OUTPUTS; LOGICAL FOUNDATIONS; SOUNDNESS AND COMPLETENESS;

LOGIC PROGRAMMING;

EID: 84867815015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45744-5_32     Document Type: Conference Paper

References (15)

1. Thomas Arts and Jürgen Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. John Hannan and Frank Pfenning. Compiler verification in LF. In Andre Scedrov, editor, Seventh Annual IEEE Symposium on Logic in Computer Science, pages 407-418, Santa Cruz, California, June 1992.
3. Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the Association for Computing Machinery, 40(1):143-184, January 1993.
4. J.-P. Jouannaud and A. Rubio. The higher-order recursive path ordering. In G. Longo, editor, Proceedings of the 14th Annual Symposium on Logic in Computer Science (LICS'99), pages 402-411, Trento, Italy, July 1999. IEEE Computer Society Press.
5. Olav Lysne and Javier Piris. A termination ordering for higher order rewrite systems. In Jieh Hsiang, editor, Proceedings of the Sixth International Conference on Rewriting Techniques and Applications, pages 26-40, Kaiserslautern, Germany, April 1995. Springer-Verlag LNCS 914.
6. Frank Pfenning. Structural cut elimination. In D. Kozen, editor, Proceedings of the Tenth Annual Symposium on Logic in Computer Science, pages 156-166, San Diego, California, June 1995. IEEE Computer Society Press.
7. Frank Pfenning. Computation and Deduction. Cambridge University Press, 2000. In preparation. Draft from April 1997 available electronically.
8. Frank Pfenning and Carsten Schürmann. System description: Twelf - a meta-logical framework for deductive systems. In H. Ganzinger, editor, Proceedings of the 16th International Conference on Automated Deduction (CADE-16), pages 202-206, Trento, Italy, July 1999. Springer-Verlag LNAI 1632.
9. Brigitte Pientka. Termination and reduction checking in the logical framework. Technical report cmu-cs-01-115, Carnegie Mellon University, 2001.
10. Lutz Plümer. Termination Proofs for Logic Programs. LNAI 446. Springer-Verlag, 1990.
11. Ekkehard Rohwedder and Frank Pfenning. Mode and termination checking for higher-order logic programs. In Hanne Riis Nielson, editor, Proceedings of the European Symposium on Programming, pages 296-310, Linköping, Sweden, April 1996. Springer-Verlag LNCS 1058.
12. J. van de Pol and H. Schwichtenberg. Strict functionals for termination proofs. In M. Dezani-Ciancaglini and G. Plotkin, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 350-364, Edinburgh, Scotland, April 1995. Springer-Verlag LNCS 902.
13. Femke van Raamsdonk. Higher-order rewriting. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA '99), pages 220-239, Trento, Italy, July 1999. Springer-Verlag LNCS 1631.
14. Roberto Virga. Higher-Order Rewriting with Dependent Types. PhD thesis, Department of Mathematical Sciences, Carnegie Mellon University, 2000.
15. Christoph Walther. On proving the termination of algorithms by machine. Artificial Intelligence, 71(1), 1994.