The computability path ordering: the end of a quest

Details The computability path ordering: the end of a quest The computability path ordering: the end of a quest

2008-06-16

arxiv.org/abs/0806.2517v1

Computer Science

Logic in Computer Science

Dans CSL'08 (2008)

Scientific paper

In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments \`a la Tait and Girard, therefore explaining the name of the improved ordering.

Affiliated with

Also associated with

No associations

Rating

The computability path ordering: the end of a quest 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 The computability path ordering: the end of a quest, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The computability path ordering: the end of a quest will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-91610