A Type-Based Approach to Divide-and-Conquer Recursion in Coq

This paper proposes a new approach to writing and verifying divide-and-conquer programs in Coq. Extending the rich line of previous work on algebraic approaches to recursion schemes, we present an algebraic approach to divide-and-conquer recursion: recursions are represented as a form of algebra, an...

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 7; no. POPL; pp. 61 - 90
Main Authors:	Abreu, Pedro, Delaware, Benjamin, Hubers, Alex, Jenkins, Christa, Morris, J. Garrett, Stump, Aaron
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 09.01.2023
Subjects:	Algebraic semantics Functional languages Recursion Software and its engineering Theory of computation Type theory Divide-and-conquer recursion strong functional programming well-founded recursion
ISSN:	2475-1421, 2475-1421
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!