Abstract
AbstractWe provide a general and modular criterion for the termination of simply typed λ-calculus extended with function symbols defined by user-defined rewrite rules. Following a work of Hughes, Pareto and Sabry for functions defined with a fixpoint operator and pattern matching, several criteria use typing rules for bounding the height of arguments in function calls. In this paper, we extend this approach to rewriting-based function definitions and more general user-defined notions of size.
Publisher
Cambridge University Press (CUP)
Reference192 articles.
1. Enhancing dependency pair method using strong computability in simply-typed term rewriting
2. Structural recursive definitions in type theory
3. van de Pol J. (1996) Termination of Higher-Order Rewrite Systems, PhD Thesis. NL: Utrecht Universiteit.
4. Giménez E. (1996) Un calcul de constructions infinies et son application à la vérification de systèmes communiquants, PhD Thesis. France: ENS Lyon.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The taming of the rew: a type theory with computational assumptions;Proceedings of the ACM on Programming Languages;2021-01-04
2. Practical Subtyping for Curry-Style Languages;ACM Transactions on Programming Languages and Systems;2019-03