Foundational Extensible Corecursion: A Proof Assistant Perspective

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 "friendly" operations, including constructors. Friendly corecursive functions 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [60 references]  Display  Hide  Download

https://hal.inria.fr/hal-01212589
Contributor : Jasmin Blanchette <>
Submitted on : Wednesday, October 7, 2015 - 3:28:47 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM
Long-term archiving on : Friday, January 8, 2016 - 10:16:02 AM

File

fouco.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel. Foundational Extensible Corecursion: A Proof Assistant Perspective. ICFP 2015, Aug 2015, Vancouver, Canada. ⟨10.1145/2784731.2784732⟩. ⟨hal-01212589⟩

Share

Metrics

Record views

201

Files downloads

195