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...
| Autor principal: | |
|---|---|
| Format: | Conference item |
| Publicat: |
2008
|