Swinging types=functions+relations+transition systems

Notions of computation and monads

Eugenio Moggi · Information and Computation · 1991 · 1.7K citations

Computing, Computer Science, Mathematics +10

Algebraic laws for nondeterminism and concurrency

Matthew Hennessy, Robin Milner · Journal of the ACM · 1985 · 1.4K citations

Computing, Computer Science, Computer Systems +15

Universal coalgebra: a theory of systems

J.J.M.M. Rutten · Theoretical Computer Science · 2000 · 1.2K citations

Computing, Computer Science, Algebra +9

Proof of correctness of data representations

C. A. R. Hoare · Acta Informatica · 1972 · 967 citations

Computing, Computer Science, Databases +11

Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165 pp. - C. Smoryński. D.1. The incompleteness theorems. Pp. 821–865. - Helmut Schwichtenberg. D.2. Proof theory: some applications of cut-elimination. Pp. 867–895. - Richard Statman. D.3. Herbrand's theorem and Gentzen's notion of a direct proof. Pp. 897–912. - Solomon Feferman. D.4. Theories of finite type related to mathematical practice. Pp. 913–971. - A. S. Troelstra. D.5. Aspects of constructive mathematics. Pp. 973–1052. - Michael P. Fourman. D.6. The logic of topoi. Pp. 1053–1090. - Henk P. Barendregt. D.1. The type free lambda calculus. Pp. 1091–1132. - Jeff Paris and Leo Harrington. D.8. A mathematical incompleteness in Peano arithmetic. Pp. 1133–1142.

William A. Howard · Journal of Symbolic Logic · 1984 · 840 citations

Computing, Computer Science, Mathematics +11