Journal article

Proof Methods for Corecursive Programs

Abstract:: Recursion is a well-known and powerful programming technique, with a wide variety of applications. The dual technique of corecursion is less well-known, but is increasingly proving to be just as useful. This article is a tutorial on four methods for proving properties of corecursive programs: fixpoint induction, the approximation lemma, coinduction, and fusion.

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., & Hutton, G. (2015). Proof Methods for Corecursive Programs. Fundamenta Informaticae, 66(4), 353–366.

MLA Style

Gibbons, J., and G. Hutton. “Proof Methods for Corecursive Programs.” Fundamenta Informaticae, vol. 66, no. 4, 2015, pp. 353–66.

Chicago Style

Gibbons, J, and G Hutton. 2015. “Proof Methods for Corecursive Programs.” Fundamenta Informaticae 66 (4): 353–66.
Share
Print

Authors

+ Gibbons, J More by this author

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

+ Hutton, G More by this author

Role:: Author

Journal:: Fundamenta Informaticae More from this journal
Volume:: 66
Issue:: 4
Pages:: 353-366

UUID:: uuid:4d74fc4b-0a19-4288-a80c-d59d1003187c
Local pid:: cs:2358
Deposit date:: 2015-03-12

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