Goswami, AK and Patnaik, LM (1990) A functional style of programming with CSP-like communication mechanisms. In: New Generation Computing, 7 (4). pp. 341-364.
Style.pdf - Published Version
Restricted to Registered users only
Download (1024Kb) | Request a copy
This paper introduces CSP-like communication mechanisms into Backus’ Functional Programming (FP) systems extended by nondeterministic constructs. Several new functionals are used to describe nondeterminism and communication in programs. The functionals union and restriction are introduced into FP systems to develop a simple algebra of programs with nondeterminism. The behaviour of other functionals proposed in this paper are characterized by the properties of union and restriction. The axiomatic semantics of communication constructs are presented. Examples show that it is possible to reason about a communicating program by first transforming it into a non-communicating program by using the axioms of communication, and then reasoning about the resulting non-communicating version of the program. It is also shown that communicating programs can be developed from non-communicating programs given as specifications by using a transformational approach.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Springer.|
|Keywords:||Functional Programming, Nondeterminism, Communication, Program Verification, Program Transformation|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||06 Jan 2011 11:52|
|Last Modified:||06 Jan 2011 11:52|
Actions (login required)