Enhancing dependency pair method using strong computability in simply-typed term rewriting

Orderings for term-rewriting systems

Nachum Dershowitz · Theoretical Computer Science · 1982 · 607 citations

Computing, Computer Science, Algorithms +6

Intensional interpretations of functionals of finite type I

W. W. Tait · Journal of Symbolic Logic · 1967 · 557 citations

Humanities, Mathematics, Logic +13

Termination of term rewriting using dependency pairs

Thomas Arts, Jürgen Giesl · Theoretical Computer Science · 2000 · 498 citations

Language Studies, Linguistics, Formal Methods +4

The size-change principle for program termination

Chin Soon Lee, Neil D. Jones, Amir M. Ben-Amram · 2001 · 379 citations · Full text

Computing, Computer Science, Algorithms +16

J. Roger Hindley and Jonathan P. Seldin. Introduction to combinators and λ-calculus. London Mathematical Society student texts, no. 1. Cambridge University Press, Cambridge etc. 1986, vi + 360 pp.

Journal of Symbolic Logic · 1988 · 352 citations

Natural Sciences, Mathematics, Algebra +4