Abstract
It is well-known that Galois connections are useful in describing some situations that occur naturally in computer science and mathematics; and recently it has been shown that Lagois connections, which are closely related to Galois connections, are similarly useful. Thus, it is natural to ask if there are not common generalizations of Galois and Lagois connections which would be useful in both disciplines. In this paper we investigate several such generalizations. The primary one, called “connections”, was defined and first investigated in 1982 by H. Crapo. We present a hierarchy of connections from (general) connections to Lagois and Galois connections, and we establish properties of them. We also give examples in both computer science and mathematics.
The authors were partially funded by the the Office of Naval Research under Contract N00014-88-K-0455.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Adámek, H. Herrlich and G.E. Strecker. Abstract and Concrete Categories. John Wiley & Sons, New York, 1990.
T. S. Blyth and M. F. Janowitz. Residuation Theory. Pergamon Press, Oxford, 1972.
G. Gierz et al. A Compendium of Continuous Lattices. Springer-Verlag, Berlin, 1980.
H. Herrlich and M. Husek. Galois connections. Lecture Notes in Computer Science, No. 239, Springer-Verlag, Berlin, 1986, pp. 122–134.
C.A.R. Hoare. The Mathematics of Programming. Clarendon Press, Oxford, 1986.
H. Crapo. Ordered sets: retracts and connections. J. of Pure and Applied Algebra, 23 (1982) pp. 13–28.
A. Melton, D. A. Schmidt, and G. E. Strecker. Galois connections and computer science applications. Lecture Notes in Computer Science, No. 240, Springer-Verlag, Berlin, 1986, pp. 299–312.
A. Melton, B.S.W. Schröder, and G. E. Strecker. Lagois connections. (to appear).
O. Ore. Galois connexions. Transactions of the American Mathematical Society, 55 (1944), pp. 493–513.
G. Pickert. Bemerkungen über Galois-Verbindungen. Archiv der Mathematik, 3 (1952), pp. 285–289.
J. Schmidt. Beiträge zur Filtertheorie, II. Mathematische Nachrichten, 10 (1953), pp. 197–232.
Peter Wegner. Programming language semantics. Courant Computer Science Symposium 2, Prentice-Hall, Englewood Cliffs, New Jersey, 1972, pp. 149–248.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Melton, A., Schröder, B.S.W., Strecker, G.E. (1992). Connections. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1991. Lecture Notes in Computer Science, vol 598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55511-0_26
Download citation
DOI: https://doi.org/10.1007/3-540-55511-0_26
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55511-7
Online ISBN: 978-3-540-47194-3
eBook Packages: Springer Book Archive