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

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Gibbons, J. (2008). Unfolding Abstract Datatypes. Mathematics of Program Construction.

MLA Style

Gibbons, J. “Unfolding Abstract Datatypes.” Mathematics of Program Construction, 2008.

Chicago Style

Gibbons, J. 2008. “Unfolding Abstract Datatypes.” In Mathematics of Program Construction.
Share
Print

Access Document

Files:: adt.pdf

(Preview, pdf, 239.8KB, Terms of use)

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

Authors

+ Gibbons, J More by this author

Institution:: University of Oxford
Division:: MPLS
Department:: Computer Science
Role:: Author

Host title:: Mathematics of Program Construction
Publication date:: 2008-07-01
DOI:: 10.1007/978-3-540-70594-9_8

UUID:: uuid:b51d2af6-25de-41ae-b3e7-9ac997de87b3
Local pid:: cs:1385
Deposit date:: 2015-03-12

Terms of use

Copyright date:: 2008

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Views and Downloads

About views and downloads

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

TO TOP