Abstract
I began my academic research career in 1968, when I moved from industrial employment as a programmer to the Chair of Computing at the Queen's University in Belfast. My chosen research goal was to discover an axiomatic basis for computer programming. Originally I wanted to express the axioms as algebraic equations, like those which provide the basis of arithmetic or group theory. But I did not know how. After many intellectual vicissitudes, I have now discovered the simple secret. I would be proud of this discovery, if I were not equally ashamed at taking so long to discover it. © 2014 Springer-Verlag.
Cite
CITATION STYLE
Hoare, T. (2014). Laws of programming: The algebraic unification of theories of concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8704 LNCS, pp. 1–6). Springer Verlag. https://doi.org/10.1007/978-3-662-44584-6_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
