Sciweavers

AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
13 years 11 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel