Abstract
Over the last years a vast number of parallel languages have been developed. A large part of these are not available on ‘normal’ computers, or they do not cooperate easily with other languages. This paper describes Scriptic, a parallel language that extends widely used sequential languages (C, C++). Scriptic offers great expressiveness by incorporating many concepts from process theory dealing with concurrency and communication. Its availability on normal computers allows many software developers to experiment with parallel programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Notes
Apple 1985. Inside Macintosh, Volume I, Addison-Wesley, Reading, Massachusetts
Baeten, J.C.M., Weijland, W.P., Process Algebra, Cambridge University Press, 1990
Bergstra J.A., Klop J.W. 1984. “Process algebra for synchronous communication.” Information & Control 60 (1/3): 77–121.
Bergstra J.A., Klop J.W. 1986. “Algebra of communicating processes.” In Proceedings CWI Symposium on Mathematics & Computer Science, (de Bakker J.W., Hazewinkel M., Lenstra J.K., eds) North-Holland, 61–94.
Delftware Technology BV, Scriptic Programmer’s Manual, Den Haag, March 1991.
C.A.R. Hoare, Communicating Sequential Processes, Prentice Hall 1985
Milner, R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, Springer, 1980
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Delft, A. (1991). The Scriptic Programming Language. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_40
Download citation
DOI: https://doi.org/10.1007/978-3-662-25209-3_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-23206-4
Online ISBN: 978-3-662-25209-3
eBook Packages: Springer Book Archive