Proving and Disproving Termination of Higher-Order Functions
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 216-231
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Dependency Pairs for Simply Typed Term RewritingLecture Notes in Computer Science, 2005
- A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite SystemsLecture Notes in Computer Science, 2004
- Termination of Simply Typed Term Rewriting by Translation and Labelling2003
- Modular Termination Proofs for Rewriting Using Dependency PairsJournal of Symbolic Computation, 2002
- A Monotonic Higher-Order Semantic Path OrderingLecture Notes in Computer Science, 2001
- Verification of Erlang Processes by Dependency PairsApplicable Algebra in Engineering, Communication and Computing, 2001
- Termination of term rewriting using dependency pairsTheoretical Computer Science, 2000
- Term Rewriting and All That1998
- TermersetzungssystemeInformatik-Fachberichte, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987