Skip Navigation

The Computer Journal 1997 40(9):572-584; doi:10.1093/comjnl/40.9.572
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Feijs, L. M. G.
Right arrow Articles by Reniers, M. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Lazy Functional Programs in a Concurrent Environment

L. M. G. Feijs1,2 and M. A. Reniers2

1 Information and Software Technology, Philips Research Laboratories Eindhoven, Prof. Holstlaan 4. PO Box NL-5656 AA Eindhoven, The Netherlands, 2 Department of Mathematics and Computing Science, Eindhoven University of Technology, PO Box 513, NL-5600 MB Eindhoven, The Netherlands, 3 Email: michelr{at}win.tue.nl

The mechanism of Landin-style stream input/output (I/O) makes it possible to write functional programs, which behave as reactive systems when executed with lazy evaluation. Functional programming languages like Gofer are attractive for programming the data transformations of a reactive system. But although the I/O behaviour can be programmed in such languages too, the functional paradigm lacks the capabilities for specification and reasoning which are needed to analyse the communication behaviour of the program and its environment. We propose to use the Algebra of Communicating Processes (ACP{varepsilon}{tau}) for that purpose. The present paper attempts to bridge the gap between the functional and the process-oriented worlds. The term rewriting system of the functional language, the operational semantics of the I/O mechanism and the process equations of a program are described and their relationships are analysed. We abstract from the details of the particular programming language by using an intermediate concept of ‘abstract functional program’.

Received June 3, 1997. revised November 21, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.