Galois Connections and Fixed Point Calculus-Reference-Cited by-同舟云学术

Galois Connections and Fixed Point Calculus

Published:2002 Issue: Volume: Page:89-150
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Backhouse Roland

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47797-7_4

Reference22 articles.

1. R. C. Backhouse and B. A. Carré. Regular algebra applied to path-finding problems. Journal of the Institute of Mathematics and its Applications, 15:161–186, 1975.

2. Garrett Birkhoff. Lattice Theory, volume 25 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, Rhode Island, 3rd edition, 1967.

3. B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge Mathematical Textbooks. Cambridge University Press, first edition, 1990.

4. E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, Berlin, 1990.

5. W. H. J. Feijen and Lex Bijlsma. Exercises in formula manipulation. In E. W. Dijkstra, editor, Formal Development of Programs and Proofs, pages 139–158. Addison-Wesley Publ. Co., 1990.

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Allegories of Symbolic Manipulations;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

2. Elements of Quantitative Rewriting;Proceedings of the ACM on Programming Languages;2023-01-09

3. Calculational Proofs in Relational Graphical Linear Algebra;Lecture Notes in Computer Science;2020

4. Verified Self-Explaining Computation;Lecture Notes in Computer Science;2019

5. UTP by Example: Designs;Engineering Trustworthy Software Systems;2017