论文部分内容阅读
In this paper we try to introduce a new approach to operational semantics of recursive programsby using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu ofmodelling partial functions by introducing undefined values in a traditional approach,we shall define apriority derivation tree for every term,and by respecting the rule“attacking the subterm of thehighest priority first”we define transition relations,computation sequences etc.directly based on astandard interpretation which includes no undefined value in its domain.Finally,we prove that ournew approach generates the same operational semantics as the traditional one.It is also pointed outthat we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semanticsof recursive programs cannot be built based on predicate logic.
In this paper we try to introduce a new approach to operational semantics of recursive programs by using ideas in the “priority method” which is a fundamental tool in Recursion Theory. In lieu of modeling partial functions by not undefined values in a traditional approach, we shall define apriority derivation tree for every term, and by respecting the rule “attacking the subterm of thehighest priority first” we define transition relations, computation sequences etc. based directly on astandard interpretation which includes no undefined value in its domain .Finally, we prove that ournewnew approach generated the same operational semantics as the traditional one. It is also pointed pointed out that we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semantics of recursive programs can not be built on predicate logic.