English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Paper

Foundational Extensible Corecursion

MPS-Authors
/persons/resource/persons183227

Blanchette,  Jasmin Christian
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1501.05425.pdf
(Preprint), 316KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Blanchette, J. C., Popescu, A., & Traytel, D. (2015). Foundational Extensible Corecursion. Retrieved from http://arxiv.org/abs/1501.05425.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0029-5B30-5
Abstract
This paper presents a formalized framework for defining corecursive functions safely in a total setting, based on corecursion up-to and relational parametricity. The end product is a general corecursor that allows corecursive (and even recursive) calls under well-behaved operations, including constructors. Corecursive functions that are well behaved can be registered as such, thereby increasing the corecursor's expressiveness. The metatheory is formalized in the Isabelle proof assistant and forms the core of a prototype tool. The corecursor is derived from first principles, without requiring new axioms or extensions of the logic.