Wellfounded recursion with copatterns

Andreas M. Abel, Brigitte Pientka
2013 Proceedings of the 18th ACM SIGPLAN international conference on Functional programming - ICFP '13  
In this paper, we study strong normalization of a core language based on System Fω which supports programming with finite and infinite structures. Building on our prior work, finite data such as finite lists and trees are defined via constructors and manipulated via pattern matching, while infinite data such as streams and infinite trees is defined by observations and synthesized via copattern matching. In this work, we take a type-based approach to strong normalization by tracking size
more » ... ion about finite and infinite data in the type. This guarantees compositionality. More importantly, the duality of pattern and copatterns provide a unifying semantic concept which allows us for the first time to elegantly and uniformly support both well-founded induction and coinduction by mere rewriting. The strong normalization proof is structured around Girard's reducibility candidates. As such our system allows for non-determinism and does not rely on coverage. Since System Fω is general enough that it can be the target of compilation for the Calculus of Constructions, this work is a significant step towards representing observation-centric infinite data in proof assistants such as Coq and Agda.
doi:10.1145/2500365.2500591 dblp:conf/icfp/AbelP13 fatcat:4nifaqt3irbizkeg2hnlhdzp74