Conference item icon

Conference item

Unfolding Abstract Datatypes

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.

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-540-70594-9_8

Authors


More by this author
Institution:
University of Oxford
Department:
Mathematical, Physical and Life Sciences Division - Department of Computer Science
Publication date:
2008-07-01
DOI:
URN:
uuid:b51d2af6-25de-41ae-b3e7-9ac997de87b3
Local pid:
cs:1385

Terms of use


Metrics



If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP