Samson Abramsky. Intensionality, definability and computation. In Alexandru Baltag and Sonja Smets, editors, Johan van Benthem on Logic and Information Dynamics, pages 121–142. Springer, 2014.
Bodil Biering, Lars Birkedal, and Noah Torp-Smith. BI-hyperdoctrines, higher-order separation logic, and abstraction. ACM Trans. Program. Lang. Syst., 29(5), 2007.
Ales Bizjak and Lars Birkedal. On models of higher-order separation logic. Electr.
Notes Theor. Comput. Sci., 336:57–78, 2018.
Cristiano Calcagno, Peter O’Hearn, and Richard Bornat. Program logic and equivalence in the presence of garbage collection. Theoretical Computer Science, 298(3):557–581, 2003. Foundations of Software Science and Computation Structures.
Nikolaos Galatos, Peter Jipsen, Tomasz Kowalski, and Hiroakira Ono.Residuated Lattices: An Algebraic Glimpse at SubstructuralLogics, Volume 151. Elsevier Science, San Diego, CA, USA, 1st edition, 2007.
Peter Johnstone. Sketches of an elephant: A topos theory compendium. Oxford
logic guides. Oxford Univ. Press, New York, 2002.
Peter T Johnstone. Conditions related to De Morgan’s law. In Applications of sheaves, pages 479–491. Springer, 1979.
Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Aleš Bizjak, Lars Birkedal,
and Derek Dreyer. Iris from the ground up: A modular foundation for higher-order
concurrent separation logic. Journal of Functional Programming, 28:e20, 2018.
Ohad Kammar, Paul Blain Levy, Sean K. Moss, and Sam Staton. A monad for full ground reference cells. In 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, pages 1–12, 2017.
William Lawvere. Adjointness in foundations. Dialectica, 23(3-4):281–296, 1969.
Paul Blain Levy, John Power, and Hayo Thielecke. Modelling environments in call-by-value programming languages. Inf. & Comp, 185:2003, 2002.
Saunders Mac Lane.Categories for the Working Mathematician. Springer, 1971.
Kenji Maillard and Paul-André Melliès. A fibrational account of local states. In 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, pages 402–413. IEEE Computer Society, 2015.
Peter O'Hearn and Robert D. Tennent. Semantics of local variables. Applications
of categories in computer science, 177:217–238, 1992.
Frank Joseph Oles. A Category-theoretic Approach to the Semantics of Programming Languages. PhD thesis, Syracuse University, Syracuse, NY, USA, 1982.
Gordon Plotkin and John Power. Notions of computation determine monads. In
FoSSaCS'02, volume 2303 of LNCS, pages 342–356. Springer, 2002.
Gordon Plotkin and John Power. Algebraic operations and generic effects. Appl.
Cat. Struct., 11(1):69–94, 2003.
David J. Pym, Peter W. O'Hearn, and Hongseok Yang. Possible worlds and
resources: the semantics of BI. Theor. Comput. Sci., 315:257–305, May 2004.
John Reynolds. The essence of ALGOL. In Peter W. O'Hearn and Robert D.
Tennent, editors, ALGOL-like Languages, Volume 1, pages 67–88. Birkhauser Boston
Inc., Cambridge, MA, USA, 1997.
John Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millennial Perspectives in Computer Science, pages 303–321. Palgrave, 2000.
John Reynolds. Separation logic: A logic for shared mutable data structures. In 17th Annual IEEE Symposium on Logic in Computer Science, LICS 2002, pages 55–74. IEEE Computer Society, 2002.
Alex Simpson. Category-theoretic structure for independence and conditional
independence. Electr. Notes Theor. Comput. Sci., 336:281–297, 2018.
Sam Staton. Instances of computational effects: An algebraic perspective. In Proc. 28th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2013), pages 519–519, June 2013.