Unfolding abstract datatypes

We argue that abstract datatypes - with public interfaces hiding private implementations - represent a form of codata rather than ordinary data, and hence that proof methods for corecursive programs are the appropriate techniques to use for reasoning with them. In particular, we show that the univer...

Full description

Bibliographic Details
Main Author: Gibbons, J
Format: Conference item
Published: 2008