SYNTAX AND OPERATIONAL SEMANTICS OF RECURSIVE PROGRAMS BASED ON PREDICATE LOGIC
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    In a traditional approach to operational semantics of recursive programs, ω was introduced as an undefined value and then flat partial orders, ω-extensions, transition relation, computation sequences etc. were defined based on a nonstandard interpretation. The aim of this paper is to avoid introducing ω. Instead we introduce directly the syntax and operational semantics of recursive programs based on a basis for predicate logic and its standard interpretation. Hence we refute the claim of Loeckx and Sieber that no operational semntics of recursive programs can build upon predicate logic.

    Reference
    Related
    Cited by
Get Citation

邵志清.建立于谓词逻辑上的递归程序及其操作语义.软件学报,1991,2(4):31-35

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:January 07,1990
  • Revised:March 26,1990
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063