Program algebra for component code

Formal Aspects of Computing

Volumn 12, Issue 1, 2000, Pages 1-17

  Bergstra, J A ^a   Loots, M E ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b NONE

Author keywords

Behaviour extraction; Canonical form; Embedding; Instructions; Program; Projection semantics; Repetition

Indexed keywords

EID: 0001885964     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00003928     Document Type: Article

References (14)

1. Backus, J.: Can programming be liberated from the Von Neumann style? A functional style and its algebra of programs. Communications of the ACM, 21(8):70-120, 1978.
2. Barendregt, H. P.: The Lambda Calculus. Its Syntax and Semantics. North-Holland, Amsterdam, 1984.
3. Bergstra, J. A., Bethke, I. and Rodenburg, P.: A prepositional logic with 4 values: True, false, divergent and meaningless. Journal of Applied Non-Classical logics, 5:199-217, 1995.
4. Bergstra, J. A. and Klop, J.-W.: Process algebra for synchronous communication. Information and Control, 60(1/3):109-137, 1984.
5. Bergstra, J. A. and Ponse, A.: Process algebra with five-valued conditions. In C. S. Calude and M. .1. Dinneen, editors, Combinatorics, Complexity, and Logic, Proceedings of DMTCS'99 and CATS'99, Australian Computer Science Communications, volume 21(3), pages 128-143. Springer-Verlag, Singapore, 1999.
6. Bergstra, J. A. and Tucker, J. V: Top-down design and the algebra of communicating processes. Science of Computer Programming, 5(2):171-199, 1984.
7. Bergstra, J. A. and van Vlijmen, S. F. M.: Theoretische Software-Engineering. ZENO-Institute, Leiden, 1998. In Dutch.
8. de Bakker, J. W.: Mathematical Theory of Program Correctness. Prentice-Hall International, 1980.
9. Emde Boas, P. van: A compositional semantics for the Turing machine. In J.W. de Bakker, 25 jaar semantiek, liber amicorum, pages 219-227. CWI, Amsterdam, 1989.
10. Groote, J. F. and Ponse, A.: Process algebra with guards. Combining Hoare logic and process algebra. Formal Aspects of Computing, 6(2):115-164, 1994. An extended abstract appeared in Proceedings CONCUR 91, Amsterdam, J. C. M. Baeten and J. F. Groote, editors, Lecture Notes in Computer Science, Vol. 527, pages 235-249. Springer-Verlag, 1991.
11. Groote, J. F. and Ponse, A.: Process algebra with guards. Combining Hoare logic and process algebra. Formal Aspects of Computing, 6(2):115-164, 1994. An extended abstract appeared in Proceedings CONCUR 91, Amsterdam, J. C. M. Baeten and J. F. Groote, editors, Lecture Notes in Computer Science, Vol. 527, pages 235-249. Springer-Verlag, 1991.
12. Hoare, C. A. R., Hayes, I. J., He Jifeng, Morgan, C. C., Roscoe, A. W., Sanders, J. W., Sorensen, I. H., Spivey, J. M. and Sufrin, B. A.: Laws of programming. Communications of the ACM, 30(8):672-686, 1987.
13. Klop, J.-W.: Term rewriting systems. In Handbook of Logic in Computer Science, volume II, pages 1-116. Oxford University Press, 1992.
14. Szyperski, C.: Component Software, Beyond Object-Oriented Programming. Addison-Wesley ACM Press, New York, 1997.