Website | Source

Charity is based on the theory of strong categorical datatypes. These are divided into two subclasses: the inductive datatypes (built up by constructors in the familiar way) and the coinductive datatypes (broken down by destructors). Programs over these datatypes are expressed by folds (catamorphisms) and by unfolds (anamorphisms), respectively.

We list some, but not all, of Charity's features below:

• Charity is "pure", and supports lazy evaluation.
• Charity is higher-order.
• All Charity computations terminate (up to user input).
  It is our belief that Charity provides a very elegant, pure framework for software development, teaching, and language research.

---

Tags: language  

Last modified 06 October 2022

---

© 2020 Ted Neward | Mixed with Bootstrap v3.1.1 | Baked with JBake v2.6.5