| 摘要: |
| 对于递归程序的操作语义,常用的刻划方法是引入无定义值ω,再定义函数的ω延拓和平坦偏序等概念,导入转移关系和计算序列。本文采用优先处理某些项的原则避免引入ω,从而直接根据谓词逻辑的基底的解释引进计算序列,并且保证了其中的转移关系是一个函数。由此我们否定了Loeckx和Sieber所宣称的“递归程序的操作语义不能建立于谓词逻辑上”的断言。 |
| 关键词: |
| DOI： |
| 分类号: |
| 基金项目: |
|
| SYNTAX AND OPERATIONAL SEMANTICS OF RECURSIVE PROGRAMS BASED ON PREDICATE LOGIC |
|
Shao Zhiqing
|
| 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. |
| Key words: |
