Algebraic Specification and Simulation of Lazy Functional Programs in aConcurrent Environment

摘要

This paper attempts to bridge the gap between the functional and the process-oriented worlds. It is shown how a simple generator can produce both Gofer program patterns and ACP equations. The patterns can be completed with data transformation functions and then executed whereas the equations can be used for reasoning and simulation. The term rewriting system (TRS) of the functional language, the structured operational semantics of (SO) of the I/O mechanism, the process equations, and the fixed point semantics of a program are described and their relationships are analyzed. We abstract from the details of the particular programming language by using an intermediate concepts of 'abstract functional program'.