Goswami, AK and Patnaik, LM (1984) Functional programming systems revisited. In: Lecture Notes in Computer Science, 181 . pp. 44-59.Full text not available from this repository. (Request a copy)
Functional Programming (FP) systems are modified and extended to form Nondeterministic Functional Programming (NFP) systems in which nondeterministic programs can be specified and both deterministic and nondeterministic programs can be verified essentially within the system. It is shown that the algebra of NFP programs has simpler laws in comparison with the algebra of FP programs. "Regular" forms are introduced to put forward a disciplined way of reasoning about programs. Finally, an alternative definition of "linear" forms is proposed for reasoning about recursively defined programs. This definition, when used to test the linearity of forms, results in simpler verification conditions than those generated by the original definition of linear forms.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||21 Aug 2009 09:09|
|Last Modified:||21 Aug 2009 09:09|
Actions (login required)