A Realizability Model for Impredicative Hoare Type Theory
Access StatusFull text of the requested work is not available in DASH at this time ("dark deposit"). For more information on dark deposits, see our FAQ.
Petersen, Rasmus Lerchedahl
MetadataShow full item record
CitationPetersen, Rasmus L., Lars Birkedal, Aleksandar Nanevski, and Greg Morrisett. 2008. A realizability model for impredicative Hoare Type Theory. In Programming Languages and Systems, ed. S. Drossopoulou, 337-352. Berlin; New York: Springer. Previously published in Lecture Notes in Computer Science 4960: 337-352.
AbstractWe present a denotational model of impredicative Hoare Type Theory, a very expressive dependent type theory in which one can specify and reason about mutable abstract data types.
The model ensures soundness of the extension of Hoare Type Theory with impredicative polymorphism; makes the connections to separation logic clear, and provides a basis for investigation of further sound extensions of the theory, in particular equations between computations and types.
Citable link to this pagehttp://nrs.harvard.edu/urn-3:HUL.InstRepos:3980869
- FAS Scholarly Articles