HORPO with Computability Closure : A Reconstruction

Details HORPO with Computability Closure : A Reconstruction HORPO with Computability Closure : A Reconstruction

2007-08-27

arxiv.org/abs/0708.3582v1

Dans 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning LNCS (2007)

Computer Science

Logic in Computer Science

Scientific paper

This paper provides a new, decidable definition of the higher- order
recursive path ordering in which type comparisons are made only when needed,
therefore eliminating the need for the computability clo- sure, and bound
variables are handled explicitly, making it possible to handle recursors for
arbitrary strictly positive inductive types.

Affiliated with

Also associated with

No associations

Rating

HORPO with Computability Closure : A Reconstruction 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 HORPO with Computability Closure : A Reconstruction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and HORPO with Computability Closure : A Reconstruction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-126326