Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Abstract Predicates and Mutable ADTs in Hoare Type Theory
 

Summary: Abstract Predicates and Mutable ADTs in
Hoare Type Theory
Aleksandar Nanevski1
, Amal Ahmed2
, Greg Morrisett1
, and Lars Birkedal3
1
Harvard University {aleks,greg}@eecs.harvard.edu
2
Toyota Technological Institute at Chicago amal@tti-c.org
3
IT University of Copenhagen birkedal@itu.dk
Abstract. Hoare Type Theory (HTT) combines a dependently typed,
higher-order language with monadically-encapsulated, stateful compu-
tations. The type system incorporates pre- and post-conditions, in a
fashion similar to Hoare and Separation Logic, so that programmers can
modularly specify the requirements and effects of computations within
types.
This paper extends HTT with quantification over abstract predicates
(i.e., higher-order logic), thus embedding into HTT the Extended Calcu-

  

Source: Ahmed, Amal - School of Informatics, Indiana University
Birkedal, Lars - Theory Department, IT-Universitetet i KÝbenhavn

 

Collections: Computer Technologies and Information Sciences