Termination analysis for partial functions
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 113-127
- https://doi.org/10.1007/3-540-61739-6_37
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Termination analysis for functional programs using term orderingsPublished by Springer Nature ,1995
- Generating polynomial orderings for termination proofsPublished by Springer Nature ,1995
- SIMPLIFICATION ORDERINGS: HISTORY OF RESULTSFundamenta Informaticae, 1995
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- The OYSTER-CLAM systemPublished by Springer Nature ,1990
- Termination Proofs for Logic ProgramsPublished by Springer Nature ,1990
- The addition of bounded quantification and partial functions to a computational logic and its theorem proverJournal of Automated Reasoning, 1988
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- The karlsruhe induction theorem proving systemPublished by Springer Nature ,1986