Browse Dept. of Computer Science by Subject "Well-founded recursive theory, order-sorted rewriting modulo axioms, termination, confluence, sufficient completeness"
Now showing items 1-1 of 1
(2011-05-10)We introduce the notion of well-founded recursive order-sorted equational logic (OS) theories modulo axioms. Such theories deﬁne functions by well-founded recursion and are inherently terminating. Moreover, for ...