Foundational extensible corecursion: a proof assistant perspective
- Submitting institution
-
Middlesex University
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 978
- Type
- E - Conference contribution
- DOI
-
10.1145/2784731.2784732
- Title of conference / published proceedings
- Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming
- First page
- 192
- Volume
- -
- Issue
- -
- ISSN
- -
- Open access status
- -
- Month of publication
- August
- Year of publication
- 2015
- URL
-
http://eprints.mdx.ac.uk/15735/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 10
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Implementing recursion and corecursion in proof assistants is notoriously error-prone, with a history of errors causing logical inconsistency. This is the first proof assistant representation of corecursion that avoids inconsistency reliably and systematically by reducing corecursion to non-recursive primitives of Higher-Order Logic. This work, formalized in Isabelle and subsequently supported by a user-friendly tool (ESOP’17), was the topic of an invited talk by Popescu at the CALCO/MFPS 2019 special session on coinduction, of competitively peer-reviewed tutorials at CADE’17, ICFP’17 and POPL’18, and of a 2021 Midlands Graduate School course.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -