Toward an algebra of nondeterministic programs

Authors:
A. Toni Cohen;Thomas J. Myers
Affiliations:
-;-
Venue:
LFP '82 Proceedings of the 1982 ACM symposium on LISP and functional programming
Year:
1982

Citing 14
Cited 0

A Transformation System for Developing Recursive Programs

Journal of the ACM (JACM)
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs

Communications of the ACM
Program improvement by internal specialization

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions

Proceedings of the International Colloquium on Formalization of Programming Concepts
An Approach to Fair Applicative Multiprogramming

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Indeterminacy, monitors, and dataflow

SOSP '77 Proceedings of the sixth ACM symposium on Operating systems principles
Function level programs as mathematical objects

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Applicative style programming, program transformation, and list operators

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A simple optimizer for FP-like languages

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Transformations of FP program schemes

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Infinite structures in programming languages

Infinite structures in programming languages
Program transformation in functional languages

Program transformation in functional languages
Aspects of Applicative Programming for Parallel Processing

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two major advantages of the FP Algebra of Programs are its mathematical tractability and the ease with which parallel evaluation may be introduced. Unfortunately, some aspects of parallelism involve nondeterministic computations which, at times, yield indeterminate results. It is possible to introduce special operators to express the indeterminacy; the augmented language is, however, less tractable than the original. Indeterminacy destroys referential transparency: program transformation is not applicable when, for example, the expression x&equil;x may not be identically true. In this paper, we extend the Algebra of Programs by introducing nondeterministic operators and formulating algebraic laws describing their behavior and the transformations applicable to them.