Foundational Extensible Corecursion: A Proof Assistant Perspective - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Foundational Extensible Corecursion: A Proof Assistant Perspective

(1, 2) , (3) , (4)
1
2
3
4

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.
Fichier principal
Vignette du fichier
fouco.pdf (261.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01212589 , version 1 (07-10-2015)

Identifiers

Cite

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⟩
77 View
72 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More