A Hierarchy of Mendler style Recursion Combinators Taming Inductive Datatypes with Negative Occurrences

作者：Ahn Ki Yung^*; Sheard Tim

来源：ACM Sigplan Notices, 2011, 46(9): 234-246.

DOI：10.1145/2034574.2034807

• Languages
• catamorphism
• histomorphism
• higher-order abstract syntax
• parametric polymorphism
• parametricity
• recursion schemes
• recursion combinators
• termination
• totality

The Mendler style catamorphism (which corresponds to weak induction) always terminates even for negative inductive datatypes. The Mendler style histomorphism (which corresponds to strong induction) is known to terminate for positive inductive datatypes. To our knowledge, the literature is silent on its termination properties for negative datatypes. In this paper, we prove that histomorphisms do not always termintate by showing a counter-example. We also enrich the Mendler collection of recursion combinators by defining a new form of Mendler style catamorphism (msfcata), which terminates for all inductive datatypes, that is more expressive than the original. We organize the collection of combinators by placing them into a hierarchy of ever increasing generality, and describing the termination properties of each point on the hierarchy. We also provide many examples (including a case study on a negative inductive datatype), which illustrate both the expressive power and beauty of the Mendler style. One lesson we learn from this work is that weak induction applies to negative inductive datatypes but strong induction is problematic. We provide a proof of weak induction by exhibiting an embedding of our new combinator into F(omega). We pose the open question: Is there a safe way to apply strong induction to negative inductive datatypes?

• 出版日期2011-9