BI hyperdoctrines and higher-order separation logic

  • Authors:
  • Bodil Biering;Lars Birkedal;Noah Torp-Smith

  • Affiliations:
  • Department of Theoretical Computer Science, IT University of Copenhagen, Denmark;Department of Theoretical Computer Science, IT University of Copenhagen, Denmark;Department of Theoretical Computer Science, IT University of Copenhagen, Denmark

  • Venue:
  • ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a precise correspondence between separation logic and a new simple notion of predicate BI, extending the earlier correspondence given between part of separation logic and propositional BI [14]. Moreover, we introduce the notion of a BI hyperdoctrine and show that it soundly models classical and intuitionistic first- and higher-order predicate BI, and use it to show that we may easily extend separation logic to higher-order. We argue that the given correspondence may be of import for formalizations of separation logic.