Unification of theories: A challenge for computing science
Unification of theories is the long-standing goal of the natural sciences; and modern physics offers a spectacular paradigm of its achievement. The structure of modern mathematics has also been determined by its great unifying theories — topology, algebra and the like. The same ideals and goals are shared by researchers and students of theoretical computing science.
KeywordsProgramming Language Unify Theory Category Theory Grand Unify Theory Programming Paradigm
Unable to display preview. Download preview PDF.
- 1.Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, 1990.Google Scholar
- 2.Barr, M., Wells, C. Category Theory for Computing Science. Prentice Hall, second edition, 1995.Google Scholar
- 3.Barrow, John D. Theories of Everything. The Quest for Ultimate Explanation. Oxford University Press, 1991.Google Scholar
- 4.Dijkstra, Edsger W., Scholten, Carel S. Predicate Calculus and Program Semantics. Springer Verlag, 1990.Google Scholar
- 5.Hennessy, M.C. Algebraic Theory of Processes. MIT Press, 1988.Google Scholar
- 6.Hentenryck, P. Van. Constraint Satisfaction in Logic Programming. MIT Press, 1989.Google Scholar
- 7.Hoare, C.A.R. Unified Theories of Programming. Oxford University Computing Laboratory, 1994. ftp://ftp.comlab.ox.ac.Uk/pub/Documents/techpapers/Tony.Hoare/theory94.ps.Z.Google Scholar
- 8.Hoare, C.A.R. Communicating Sequential Processes. Prentice Hall, 1985.Google Scholar
- 9.Lloyd, J.W. Foundations of Logic Programming. Springer Verlag, second edition, 1987.Google Scholar
- 10.Milner, A.J.R.G. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
- 11.Vickers, S. Topology via Logic. Cambridge University Press, 1989.Google Scholar