• Publications
  • Influence

Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from publisher and metadata sources).
  • Nachum Dershowitz
  • Mathematics, Computer Science
  • J. Symb. Comput.
  • 1987 (First Publication: 1 February 1987)
  • This survey describes methods for proving that systems of rewrite rules are terminating programs. We illustrate the use in termination proofs of various kinds of orderings on terms, includingContinue Reading
  • Nachum Dershowitz, Jean-Pierre Jouannaud
  • Mathematics, Computer Science
  • Handbook of Theoretical Computer Science, Volume…
  • 1990 (First Publication: 2 January 1991)
  • Publisher Summary This chapter focuses on rewrite systems, which are directed equations used to compute by repeatedly replacing sub-terms of a given formula with equal terms until the simplest formContinue Reading
  • Nachum Dershowitz
  • Computer Science
  • FOCS
  • 1979 (First Publication: 29 October 1979)
  • Methods of proving that a term-rewriting system terminates are presented. They are based on the notion of "simplification orderings", orderings in which any term that is homeomorphically embeddableContinue Reading
  • Nachum Dershowitz
  • Computer Science, Mathematics
  • Inf. Process. Lett.
  • 1979 (First Publication: 1 December 1979)
  • Note that this definition does not require that > is well-founded (cf. [5,7]). We shall assut%7e throughout this note that all function symbols ? +e fixed arity. A term-rewriting system P over a setContinue Reading