On the Big-R Notation for Describing Interative and Recursive Behaviors

International Journal of Cognitive Informatics and Natural Intelligence (IJCINI)

Volumn 2, Issue 1, 2008, Pages 17-28

  Wang, Yingxu ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

basic control structures; cognitive informatics; computing; formal methods; iteration; loop; mathematical notations; recursion; RTPA; semantics; software engineering; syntax; the big R notation

Indexed keywords

EID: 85001871692     PISSN: 15573958     EISSN: 15573966     Source Type: Journal    
DOI: 10.4018/jcini.2008010102     Document Type: Article

References (29)

1. Backhouse, R. C. (1968). Program construction and verification. London: Prentice Hall International.
2. Backus, J. (1978). Can programming be liberated from the van Neumann Style? Communications of the ACM, 21(8), 613–641.
3. Cries, D. (1981). The science of programming. New York: Springer-Verlag.
4. de Bakker, J. W. (1980). Mathematical theory of program correctness. London: Prentice Hall International.
5. Dijkstra, E. W. (1976). A discipline of programming. Englewood Cliffs, NJ: Prentice Hall.
6. Hehner, E. C. R. (1984). Predicative programming, parts I and II. Communications of the ACM, 27(2), 134–151.
7. Hermes, H. (1969). Enumerability, decidability, computability. New York: Springer-Verlag.
8. Hoare, C. A. R. (1985). Communicating sequential processes. London: Prentice Hall International.
9. Hoare, C. A. R., Hayes, I. J., He, J., Morgan, C. C., Roscoe, A. W., Sanders, J. W., et al. (1987, August). Laws of programming. Communications of the ACM, 30(8), 672–686.
10. Horstmann, C., & Budd, T. (2004). Big C++. Danvers, MA: John Wiley & Sons.
11. Jones, C. B. (1980). Software development: A rigorous approach. London: Prentice Hall International.
12. Kleene, S. C. (1952). Introduction tometa-mathematics. North Holland, Amsterdam.
13. Louden, K. C. (1993). Programming languages: Principles and practice. Boston: PWS-Kent Publishing.
14. McDermid, J. (Ed.). (1991). Software engineer's reference book. Oxford: Butterworth Heinemann.
15. Meek, B. L. (1991). Early high-level languages (Chapter 43). In J. McDermid (Ed.), Software engineer's reference book. Oxford: Butterworth Heinemann.
16. Mendelson, E. (1964). Introduction to mathematical logic. New York: Van Nostrand Reinhold.
17. Peter, R. (1967). Recursive functions. New York: Academic Press.
18. Rayward-Smith, V. J. (1986). A first course in computability. Oxford: Blackwell Scientific.
19. Tan, X., Wang, Y., & Ngolah, C. (2004, August). Specification of the RTPA grammar and its recognition. In Proceedings of the 3rd IEEE International Conference on Cognitive Informatics (ICCI'04), Victoria, Canada, (pp. 54–63). IEEE CS Press.
20. Tarski, A. (1955). A lattice-theoretic fixed point theorem and its applications. Pacific Journal of Mathematics, 5, 285–309.
21. Wang, Y. (2002, October). The real-time process algebra (RTPA). Annals of Software Engineering: An International Journal, 14, 235–274. Kluwer Academic Publishers.
22. Wang, Y. (2003). Using process algebra to describe human and software system behaviors. Brain and Mind: A Transdisciplinary Journal of Neuroscience and Neurophilosophy, 4(2), 199–213.
23. Wang, Y. (2006a, March). On the informatics laws and deductive semantics of software. IEEE Transactions on Systems, Man, and Cybernetics (Part C), 36(2), 161–171.
24. Wang, Y. (2006b, May 8–10). A unified mathematical model of programs. In Proceedings of the 19th Canadian Conference on Electrical and Computer Engineering (CCECE'06), Ottawa, ON, Canada, (pp. 2346–2349).
25. Wang, Y. (2006c, July). Cognitive informatics and contemporary mathematics for knowledge representation and manipulation, invited plenary talk. In Proceedings of the 1st International Conference on Rough Set and Knowledge Technology (RSKT'06), Chongqing, China, (pp. 69–78). Lecture Notes in Artificial Intelligence, LNAI 4062: Springer-Verlag.
26. Wang, Y (2007a). Software engineering foundations: A software science perspective. CRC book series on software engineering (Vol. II). Boca Raton, FL: CRC Press.
27. Wang, Y (2007b). Keynote speech: On theoretical foundations of software engineering and denotational mathematics. In Proceedings of the 5th Asian Workshop on Foundations of Software, Xiamen, China, (pp. 99–102).
28. Wilson, L. B., & Clark, R. G. (1988). Comparative programming language. Wokingham, UK: Addison-Wesley Publishing.
29. Wirth, N. (1976). Algorithms + data structures = programs. Englewood Cliffs, NJ: Prentice Hall.