Certifying a Termination Criterion Based on Graphs, without Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Certifying a Termination Criterion Based on Graphs, without Graphs

Abstract

This paper presents a extention of the matrix interpretation ordering for term rewriting system termination.
No file

Dates and versions

hal-01125530 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01125530 , version 1

Cite

Pierre Courtieu, Julien Forest, Xavier Urbain. Certifying a Termination Criterion Based on Graphs, without Graphs. TPHOLs'08 Theorem Proving in Higher Order Logics, Montr?al, Canada, Jan 2008, Montreal, Canada. pp.183-198. ⟨hal-01125530⟩

Collections

CNAM CEDRIC-CNAM
29 View
0 Download

Share

Gmail Facebook X LinkedIn More