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...

Full beskrivning

Bibliografiska uppgifter
Huvudupphovsman: Gibbons, J
Materialtyp: Conference item
Publicerad: 2008
Search Result 1

Unfolding abstract datatypes av Gibbons, J

Publicerad 2008
Conference item