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
116
click to vote
LPAR
2010
Springer
161
views
Automated Reasoning
»
more
LPAR 2010
»
On Strong Normalization of the Calculus of Constructions with Type-Based Termination
15 years 1 months ago
Download
www-sop.inria.fr
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...
Benjamin Grégoire, Jorge Luis Sacchini
claim paper
Read More »