Abstract
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 modelling partial functions by introducing undefined values in a traditional approach, we shall define a priority derivation tree for every term, and by respecting the rule “attacking the subterm of the highest priority first” we define transition relations, computation sequences etc. directly based on a standard interpretation which includes no undefined value in its domain. Finally, we prove that our new approach generates the same operational semantics as the traditional one. It is also pointed out that we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semantics of recursive programs cannot be built based on predicate logic.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
