On the semantics of control statements

Authors:
James M. Nead
Affiliations:
University of Minnesota, Minneapolis, MN
Venue:
ACM SIGPLAN Notices
Year:
1979

Citing 7
Cited 0

An event-driven compiling technique

Communications of the ACM
Synchronization with eventcounts and sequencers

Communications of the ACM
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Communicating sequential processes

Communications of the ACM
Complementary Definitions of Programming Language Semantics

Complementary Definitions of Programming Language Semantics
SP-Grammars: context-free grammars for structured programming

ACM SIGPLAN Notices
Some definitions for algebraic data type specifications

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of programming language semantics is viewed from a new perspective, in which the notion of process (defined as a partial ordering of events) is taken as fundamental and the notion of state is derivative. This type of semantics is seen to be compatible with the algebraic definition of data types. A statement of a program is taken to be an axiom of an abstract process, which in turn represents a real execution of the program. The method is found to be useful in discussing the nature of program control, especially concurrent processes.