Polymorphism and separation in Hoare type theory

Polymorphism and separation in Hoare type theory (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Aleksandar Nanevski , Greg Morrisett , Lars Birkedal

Venue:	In icfp
Citations:	61 - 14 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Polymorphism and separation in Hoare type theory	INFERENCE
AUTHOR NAME	Aleksandar Nanevski	SVM HeaderParse 0.2
AUTHOR AFFIL	Harvard University Harvard University IT University of Copenhagen	SVM HeaderParse 0.2
AUTHOR NAME	Greg Morrisett	SVM HeaderParse 0.2
AUTHOR AFFIL	Harvard University Harvard University IT University of Copenhagen	SVM HeaderParse 0.2
AUTHOR NAME	Lars Birkedal	SVM HeaderParse 0.2
AUTHOR AFFIL	Harvard University Harvard University IT University of Copenhagen	SVM HeaderParse 0.2
ABSTRACT	In previous work we have proposed a Dependent Hoare Type Theory (HTT) as a framework for development and reasoning about higher-order functional programs with effects of state, aliasing and nontermination. The main feature of HTT is the type of Hoare triples {P}x:A{Q} specifying computations with precondition P and postcondition Q, that return a result of type A. Here we extend HTT with predicative type polymorphism. Type quantification is possible in both types and assertions, and we can also quantify over Hoare triples. We show that as a consequence it becomes possible to reason about disjointness of heaps in the assertion logic of HTT. We use this expressiveness to interpret the Hoare triples in the “small footprint ” manner advocated by Separation Logic, whereby a precondition tightly describes the heap fragment required by the computation. We support stateful commands of allocation, lookup, strong update, deallocation, and pointer arithmetic. 1	SVM HeaderParse 0.2
YEAR	2006	SVM HeaderParse 0.2
VENUE	In icfp	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	62--73	INFERENCE
TECH	Technical Report TR-10-06	INFERENCE
CITATIONS	44 found	ParsCit 1.0