Computability Closure: Ten Years Later

Details Computability Closure: Ten Years Later Computability Closure: Ten Years Later

2007-07-10

arxiv.org/abs/0707.1372v1

Dans Colloquium in honor of Jean-Pierre Jouannaud, 4600 (2007)

Computer Science

Logic in Computer Science

Scientific paper

The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the author's PhD. In this paper, we show how this notion can also be used for dealing with beta-normalized rewriting with matching modulo beta-eta (on patterns \`a la Miller), rewriting with matching modulo some equational theory, and higher-order data types (types with constructors having functional recursive arguments). Finally, we show how the computability closure can easily be turned into a reduction ordering which, in the higher-order case, contains Jean-Pierre Jouannaud and Albert Rubio's higher-order recursive path ordering and, in the first-order case, is equal to the usual first-order recursive path ordering.

Affiliated with

Also associated with

No associations

Rating

Computability Closure: Ten Years Later does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computability Closure: Ten Years Later, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computability Closure: Ten Years Later will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-453382