The laws of Occam programming (Q2640348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The laws of Occam programming |
scientific article; zbMATH DE number 4187116
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The laws of Occam programming |
scientific article; zbMATH DE number 4187116 |
Statements
The laws of Occam programming (English)
0 references
1988
0 references
The authors describe an equational axiomatization of the semantics of OCCAM. They show that WHILE-free programs have a normal form, such that two programs are semantically equivalent if and only if their normal forms are syntactically equivalent. This shows that their equational axiomatization, together with an induction axiom, is a sound and complete proof system for proving the equivalence of OCCAM programs. The paper is very clearly written.
0 references
Occam
0 references
algebraic semantics of parallel processes
0 references
0.8627685
0 references
0.86010915
0 references
0 references
0 references
