Document Type
Article
Publication Date
1987
Abstract
Backus' FP-systems are made more practical by introducing into them lazy evaluation and nondeterminism. This is done in the framework of a concrete programming language called FP*. From the one hand, this language is almost as mathematical as FP-systems are. From the other hand, it gives the possibility to manage secondary memory and to develop such applications as, for instance, interactive and distributed file systems. Experimental versions of a compiler and an interpreter for the FP* language are implemented.
Recommended Citation
Radensky, A. Lazy Evaluation and Nondeterminism make Backus' FP-systems More Practical, ACM SIGPLAN Notices, Vol. 22, N 4, 1987, ACM Press, 33-40.
Peer Reviewed
1
Copyright
Association for Computing Machinery
Comments
© ACM, 1987. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM SIGPLAN Notices volume 22, number 4 (1987).