论文信息 - Functional Programming and Communicating Processes

Functional Programming and Communicating Processes

Taking the requirements of the Kent operating system project as background, we have sketched a history of some of the methods by which people have sought to represent communicating processes in a functional programming language. It seems to us that the scheme of William Stoye is the first that permits the description of non deterministic behaviour without violating the requirements of referential transparency. We have described our own modifications to the Stoye scheme, permitting static type security in messages, synchronous communication, and separately garbage collected heap spaces.

David Turner | D. Turner

[1] D. A. Turner,et al. Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

[2] Gilles Kahn,et al. Coroutines and Networks of Parallel Processes , 1977, IFIP Congress.

[3] David Turner. An overview of Miranda , 1986, SIGP.

[4] Peter Henderson,et al. Purely Functional Operating Systems , 1982 .

[5] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[6] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .

[7] W. R. Stoye. The implementation of functional languages using custom hardware , 1985 .

[8] Peter Henderson. Functional geometry , 1982, LFP '82.

[9] William Stoye,et al. A new scheme for writing functional operating systems , 1984 .

[10] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[11] Samson Abramsky,et al. Secd-m: a Virtual Machine for Applicative Programming , 1985, FPCA.