Abstract
Strand is a logic programming language designed for efficient programming of parallel computers. This tutorial describes the syntax and semantics of Strand and illustrates some of the programming techniques that can be used to construct real Strand programs. The syntax is based on Prolog, but the semantics are quite different and Strand does not support those features of Prolog that might impair performance on real parallel machines. The absence of backtracking and unification reveals dataflow as the dominant feature of the computational model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shapiro, E. The Family of Concurrent Logic Programming Languages, ACM Computing Surveys 1989; 21(3): 413–510.
Foster, I and Taylor, S, Strand: New Concepts in Parallel Programming, Prentice-Hall Inc New Jersey, 1989.
Strand Software Technologies, STRAND88 USER MANUAL, Buckingham Release, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
Florentin, J., Gittins, M. (1993). Parallel Logic Programming in Strand: A Tutorial. In: Broda, K. (eds) ALPUK92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3421-3_17
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3421-3_17
Publisher Name: Springer, London
Print ISBN: 978-3-540-19783-6
Online ISBN: 978-1-4471-3421-3
eBook Packages: Springer Book Archive