Multiparadigm Programming Language: Semantics 0.9

WORK IN PROGRESS
The goal of this work is

to design an abstract grammar for those elements that programming languages have in common in particular, for abstraction, generalization, and modules and
to integrate the grammar with abstract grammars for a variety of programming paradigms.

This work is supports ideas developing in Introduction to Programming Languages where abstraction, generalization and computational models are used as unifying concepts for understanding programming languages.

Imperative Programming

Axiomatic Semantics

Skip

{P}skip{P}

Assignment

{P[x₀ is e₀ ,..., x_n is e_n]}x₀ ,..., x_n := e₀ ,..., e_n{P}

Linear Sequence

P=Q₀, {Q_i} command_i+1{Q_i+1}, Q_n=R; for i=0..n

{P}{; command₁ ,..., command_n }{R}

Selection

{P /\ guard_i} command _i{Q}; for i=1..n

{P} {? guard₁ --> command₁ , ... , guard_n --> command_n } {Q}

Iteration

{I /\ guard_i} command _i{I}

{I} {* guard₁ --> command₁ , ... , guard_n --> command_n } {I, /\i not guard_i}

for i=1..n

Parallel

{P} command _i{Q_i}

{P} {|| command₁ ,..., command_n } {/\Q_i}

for i=1..n

Exceptions

by 1998 Anthony A. Aaby. Send comments to aabyan@wwc.edu