Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
130
Voted
RTA
2004
Springer
100
views
Theoretical Computer Science
»
more
RTA 2004
»
A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
15 years 8 months ago
Download
www-rocq.inria.fr
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 type...
Frédéric Blanqui
claim paper
Read More »