Functional Programming with Apomorphisms / Corecursion

@inproceedings{Uustaluy1998FunctionalPW,
  title={Functional Programming with Apomorphisms / Corecursion},
  author={Tarmo Uustaluy},
  year={1998}
}
  • Tarmo Uustaluy
  • Published 1998
In the mainstream categorical approach to typed (total) functional programming, functions with inductive source types deened by primitive recursion are called paramorphisms; the utility of primitive recursion as a scheme for deening functions in programming is well-known. We draw attention to the dual notion of apomorphisms|functions with coinductive target types deened by primitive corecursion|, and show on examples that primitive corecursion is useful in programming.