Proving innermost normalisation automatically
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 157-171
- https://doi.org/10.1007/3-540-62950-5_68
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Automatically proving termination where simplification orderings failPublished by Springer Nature ,1997
- Modular proofs for completeness of hierarchical term rewriting systemsTheoretical Computer Science, 1995
- Natural terminationTheoretical Computer Science, 1995
- SIMPLIFICATION ORDERINGS: HISTORY OF RESULTSFundamenta Informaticae, 1995
- ABSTRACT RELATIONS BETWEEN RESTRICTED TERMINATION AND CONFLUENCE PROPERTIES OF REWRITE SYSTEMSFundamenta Informaticae, 1995
- Generating polynomial orderingsInformation Processing Letters, 1994
- Termination by completionApplicable Algebra in Engineering, Communication and Computing, 1990
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- A note on simplification orderingsInformation Processing Letters, 1979