For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point unfolding. Two solutions of this problem are proposed: The first one is a system with equi-recursive nonstrictly positive type constructors of arbitrary finite kinds, where fixedpoint unfolding is computationally invisible due to its treatment on the level of type equality. Positivity is ensured by a polarized kinding system, and strong normalization is proven by a model construction based on saturated sets. The second solution is a formulation of primitive recursion for arbitrary type constructors of any rank. Although without positivity restriction, the second system embeds - even operationally - into the first one. © Springer-Verlag 2004.
CITATION STYLE
Abel, A., & Matthes, R. (2004). Fixed points of type constructors and primitive recursion. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3210, 190–204. https://doi.org/10.1007/978-3-540-30124-0_17
Mendeley helps you to discover research relevant for your work.