A type-based termination criterion for dependently-typed higher-order rewrite systems

Details A type-based termination criterion for dependently-typed higher-order rewrite systems A type-based termination criterion for dependently-typed higher-order rewrite systems

2006-10-11

arxiv.org/abs/cs/0610062v1

Dans 15th International Conference on Rewriting Techniques and Applications - RTA'04 (2004) 15 p

Computer Science

Logic in Computer Science

Colloque avec actes et comit\'{e} de lecture. internationale

Scientific paper

Several authors devised type-based termination criteria for ML-like languages
allowing non-structural recursive calls. We extend these works to general
rewriting and dependent types, hence providing a powerful termination criterion
for the combination of rewriting and beta-reduction in the Calculus of
Constructions.

Affiliated with

Also associated with

No associations

Rating

A type-based termination criterion for dependently-typed higher-order rewrite systems 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 A type-based termination criterion for dependently-typed higher-order rewrite systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A type-based termination criterion for dependently-typed higher-order rewrite systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578711