| doi:10.2201/NiiPi.2013.10.4 |
| Wander types : A formalization of coinduction-recursion |
| Venanzio CAPRETTA1 |
| 1School of Computer Science, University of Nottingham |
(Received: May 5,2012)
(Revised: September 30,2012)
(Accepted: December 19,2012) |
Abstract:
Wander types are a coinductive version of inductive-recursive definitions. They are defined by simultaneously specifying the constructors of the type and a function on the type itself. The types of the constructors can refer to the function component and the function itself is given by pattern matching on the constructors.
Wander types are different from inductive-recursive types in two ways: the structure of the elements is not required to be well-founded, so infinite applications of the constructors are allowed; and the recursive calls in the definition of the function are not required to be on structurally smaller arguments.
Wander types generalize several known type formers. We can use the functional component to control the way the data branch. This allows not only the implementation of coinduction, but also of induction, by imposing well-foundedness through an appropriate function definition. Special instances of wander types are: plain inductive and coinductive types, inductive-recursive types, mixed inductive-coinductive types, continuous stream processors.
|
Keywords:
Type Theory, Coinduction, Induction-Recursion
|
|
|
| PDF(546KB) | References |
National Institute of Informatics is a member of CrossRef.
|
