Unfolding Abstract Datatypes

Abstract datatypes — with public interfaces hiding private implementations — represent a form of codata rather than ordinary data, and so proof methods for corecursive programs are the appropriate techniques to use for reasoning with them. In particular, we show that the universal properties of unfo...

Description complète

Détails bibliographiques
Auteur principal: Gibbons, J
Format: Conference item
Publié: 2008
Search Result 1

Unfolding abstract datatypes par Gibbons, J

Publié 2008
Conference item