Files in this item



application/pdfwell-founded-recursion.pdf (624kB)
(no description provided)PDF


Title:Incremental Checking of Well-Founded Recursive Specifications Modulo Axioms
Author(s):Schernhammer, Felix; Meseguer, José
Subject(s):Well-founded recursive theory, order-sorted rewriting modulo axioms, termination, confluence, sufficient completeness
Abstract:We introduce the notion of well-founded recursive order-sorted equational logic (OS) theories modulo axioms. Such theories define functions by well-founded recursion and are inherently terminating. Moreover, for well-founded recursive theories important properties such as confluence and sufficient completeness are modular for so-called fair extensions. This enables us to incrementally check these properties for hierarchies of such theories that occur naturally in modular rule-based functional programs. Well-founded recursive OS theories modulo axioms contain only commutativity and associativity-commutativity axioms. In order to support arbitrary combinations of associativity, commutativity and identity axioms, we show how to eliminate identity and (under certain conditions) associativity (without commutativity) axioms by theory transformations in the last part of the paper.
Issue Date:2011-05-10
Genre:Technical Report
Publication Status:unpublished
Peer Reviewed:not peer reviewed
Date Available in IDEALS:2011-05-10

This item appears in the following Collection(s)

Item Statistics