Simulating Term-Rewriting in LPF and in Display Logic
نویسنده
چکیده
We show how the convenience and power of term-rewriting can sometimes be obtained in logical systems which do not explicitly have this capability. We consider the Logic of Partial Functions, and show how an undeened term can often be rewritten to a deened term. Although LPF and Display Logic are unrelated, we also show how Display Logic eeectively allows rewrite-style simpliications, although the logic has no axiom or rule permitting this (or indeed any notion of equality). We then describe how these \rewrite" procedures are implemented in Isabelle, using HOL-style conversionals.
منابع مشابه
On the mechanisation of the logic of partial functions
It is well known that partial functions arise frequently in formal reasoning about programs. A partial function may not yield a value for every member of its domain. Terms that apply partial functions thus may not denote, and coping with such terms is problematic in two-valued classical logic. A question is raised: how can reasoning about logical formulae that can contain references to terms th...
متن کاملSimulation as a Correct Transformation of Rewrite Systems
Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in the original rewrite system. In this paper it is shown that if such a simulation is sound and complete and preserves termination, then the transformation of the original into the simulating rewrite system constitutes a correct...
متن کاملFree Variables and Subexpressions in Higher-Order Meta Logic
This paper addresses the problem of how to represent free variables and subexpressions involving-bindings. The aim is to apply what is known as higher-order abstract syntax to higher-order term rewriting systems. Directly applying-reduction for the purpose of subterm-replacement is incompatible with the requirements of term-rewriting. A new meta-level representation of subterms is developed tha...
متن کاملACD Term Rewriting
In this paper we introduce Associative Commutative Distributive Term Rewriting (ACDTR), a rewriting language for rewriting logical formulae. ACDTR extends AC term rewriting by adding distribution of conjunction over other operators. Conjunction is vital for expressive term rewriting systems since it allows us to require that multiple conditions hold for a term rewriting rule to be used. ACDTR u...
متن کاملReasoning About Partial Functions in the Formal Development of Programs
Partial functions and operators are used extensively in the formal development of programs and thus development methods have to clarify how to reason about them. There are a number of approaches which cover up the fact that “First Order Predicate Calculus” does not handle undefined logical values. There is also at least one specific “Logic of Partial Functions” (LPF) which tackles the issue at ...
متن کامل