Termination Analysis for Functional Programs
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Termination of Nested and Mutually Recursive AlgorithmsJournal of Automated Reasoning, 1997
- Termination analysis for partial functionsPublished by Springer Nature ,1996
- Implicit induction in conditional theoriesJournal of Automated Reasoning, 1995
- SIMPLIFICATION ORDERINGS: HISTORY OF RESULTSFundamenta Informaticae, 1995
- On proving the termination of algorithms by machineArtificial Intelligence, 1994
- Automatisierung von TerminierungsbeweisenPublished by Springer Nature ,1991
- 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