Monotone recursive types and recursive data representations in Cedille

01/09/2020

∙

by   Christopher Jenkins, et al.

∙

The University of Iowa

∙

0

∙

share

Guided by Tarksi's fixpoint theorem in order theory, we show how to derive monotone recursive types with constant-time roll and unroll operations within Cedille, an impredicative, constructive, and logically consistent pure type theory. As applications, we use monotone recursive types to generically derive two recursive representations of data in the lambda calculus, the Parigot and Scott encoding, together with constant-time destructors, a recursion scheme, and the standard induction principle.