Skip to main content
Log in

A standard model-theoretic approach to operational semantics of recursive programs

  • Regular Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. J. Loeckx and K. Sieber, The Foundations of Program Verification. 2nd Edition, John Wiley and Sons, 1987.

  2. R. I. Roare, Recursively Enumerable, Sets and Degrees. Springer-Verlag, 1987.

  3. C. C. Chang and H. J. Keisler, Model Theory, 2nd Edition. North-Holland Publ. Co., 1976.

  4. Z. Zhao, Operational semantics of recursive programs based on predicate logic.J. of Software, 1991, 2 (4), 31–35.

    Google Scholar 

  5. R. M. Burstall and J. A. Darlington, A translation system for developing recursive programs.J. of ACM, 1977, 24(1), 44–67.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. M. Cadiou, Recursive definitions of partial functions and their computations. Ph. D thesis, Stanford Univ., 1972.

  7. J. Vuillemin, Correct and optimal implementations of recursion in a simple programming languagesJ. of Comp. Syst. Sc., 1976, 9 (3), 332–354.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhiqing, S. A standard model-theoretic approach to operational semantics of recursive programs. J. of Compt. Sci. & Technol. 8, 155–161 (1993). https://doi.org/10.1007/BF02939478

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02939478

Keywords

Navigation