|
 
|
[CFU08b] Certifying a Termination Criterion Based on Graphs, without Graphs
Conférence Internationale avec comité de lecture : TPHOLs'08 Theorem Proving in Higher Order Logics, Montréal, Canada, January 2008, Vol. 5170, pp.183-198, Series Lecture Notes in Computer Science, Montreal, Canada,
motcle:
Résumé:
This paper presents a extention of the matrix interpretation ordering for term rewriting system termination.
Equipe:
sys
BibTeX
| @inproceedings { | |||
| CFU08b, | |||
| title | = | "{Certifying a Termination Criterion Based on Graphs, without Graphs}", | |
| author | = | " P. Courtieu and J. Forest and X. Urbain ", | |
| booktitle | = | "{TPHOLs'08 Theorem Proving in Higher Order Logics, Montréal, Canada}", | |
| year | = | 2008, | |
| month | = | "January", | |
| series | = | "Lecture Notes in Computer Science", | |
| volume | = | 5170, | |
| pages | = | "183-198", | |
| address | = | "Montreal, Canada", | |
| } | |||
