Unfolding Abstract Datatypes
Jeremy Gibbons abstract
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 unfold operators are perfectly suited for the task. We illustrate with the solution to a problem in the recent literature.
infobook title | Mathematics of Program Construction |
month | jul |
year | 2008 |
links
BibTeX
Link (pdf)
related pages
|
