Many apparently divergent approaches to specifying formal semantics of programminglanguages are applications of initial algebra semantics. In this paper an overview of initial algebra semantics is provided. The major...
详细信息
Many apparently divergent approaches to specifying formal semantics of programminglanguages are applications of initial algebra semantics. In this paper an overview of initial algebra semantics is provided. The major technical feature is an initial continuous algebra which permits unified algebraic treatment of iterative and recursive semantic features in the same framework as more basic operations.
The ideas behind correctness proofs for programs are outlined, and conventional definitions of assignment, etc., are given. The main part of this paper is the idealized development of a nontrivial program in a discipl...
详细信息
The meaning of many kinds of expressions in programminglanguages can be taken as elements of certain spaces of “partial” objects. In this report these spaces are modeled in one universal domain PωPω{\bf P} \omega...
详细信息
The meaning of many kinds of expressions in programminglanguages can be taken as elements of certain spaces of “partial” objects. In this report these spaces are modeled in one universal domain PωPω, the set of all subsets of the integers. This domain renders the connection of this semantic theory with the ordinary theory of number theoretic (especially general recursive) functions clear and straightforward.
The correspondence between programminglanguages and the lambda-calculus presented in Part I of the paper is extended here to include iteration statements, jumps, and procedures. Programs containing loops are represen...
详细信息
So-called 'guarded commands' are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly eve...
详细信息
So-called 'guarded commands' are introduced as a building block for alternative and repetitive constructs that allow nondeterministic program components for which at least the activity evoked, but possibly even the final state, is not necessarily uniquely determined by the initial state. For the formal derivation of programs expressed in terms of these constructs, a calculus will be be shown. [ABSTRACT FROM AUTHOR]
暂无评论