Verifying Termination and Reduction Properties about Higher-Order Logic Programs
- 1 December 2005
- journal article
- Published by Springer Science and Business Media LLC in Journal of Automated Reasoning
- Vol. 34 (2), 179-207
- https://doi.org/10.1007/s10817-005-6534-3
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A predicative analysis of structural recursionJournal of Functional Programming, 2002
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- A semantic basis for the termination analysis of logic programsThe Journal of Logic Programming, 1999
- Strict functionals for termination proofsPublished by Springer Science and Business Media LLC ,1995
- On proving the termination of algorithms by machineArtificial Intelligence, 1994
- HiLog: A foundation for higher-order logic programmingThe Journal of Logic Programming, 1993
- A framework for defining logicsJournal of the ACM, 1993
- Proving termination properties of prolog programs: A semantic approachThe Journal of Logic Programming, 1992
- Logic programming in the LF logical frameworkPublished by Cambridge University Press (CUP) ,1991
- Natural deduction as higher-order resolutionThe Journal of Logic Programming, 1986