Lawson topology

In mathematics and theoretical computer science the Lawson topology, named after Jimmie D. Lawson, is a topology on partially ordered sets used in the study of domain theory. The lower topology on a poset P is generated by the subbasis consisting of all complements of principal filters on P. The Lawson topology on P is the smallest common refinement of the lower topology and the Scott topology on P.

Properties
  • If P is a complete upper semilattice, the Lawson topology on P is always a complete T1 topology.
gollark: There isn't really, because if you're just dealing with random TCP streams I don't think they have a similar thing to the HTTP Host header, which tells you what domain ~~you~~ the client wants to access.
gollark: caddy is a newer and trendier one which does nice stuff like HTTPS without having to use an external program like certbot, but in my opinion v2 made configuring it quite annoying.
gollark: I'd recommend nginx for reverse-proxying, it has reasonably non-annoying configuration and is very fast.
gollark: Reverse proxies are mostly a HTTP thing. You can probably get away with just running the other stuff on multiple ports.
gollark: You can also have that one reverse proxy server do all the HTTPS, which is mildly convenient.

See also

References
  • G. Gierz, K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove, D. S. Scott (2003), Continuous Lattices and Domains, Encyclopedia of Mathematics and its Applications, Cambridge University Press. ISBN 0-521-80338-1




This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.