Source code of two interpreters for the Charity language:

1. The original C implementation, by the Charity Development Group, dated 28 September 2000

2. An SML implementation, by Min Zeng, dated March 2003

Includes an archival version of the Charity website, all available literature, example programs, and binary releases of the original implementation.

• Gillian Posey’s Circuits package, dated 13 March 1997

• Robin Cockett’s work on model checking, including:

  • HML checker, dated 26 October 2000
  • Modal Mu checker, dated 22 November 2000
  • Circuit checker, dated 2 September 2001

• R. Cockett (1991) “Introduction to distributive categories”
• T. Fukushima (1991) “Charity user manual”
• R. Cockett, T. Fukushima (1992) “About Charity”
• R. Cockett (1992) “Distributive logic”
• R. Cockett, D. Spencer (1992) “Strong categorical datatypes I”
• R. Cockett, D. Spencer (1992) “Strong categorical datatypes II: A term logic for categorical programming”
• M. Hermann (1992) “A lazy graph reduction machine for Charity: Charity abstract reduction machine (CHARM)”
• T. Simpson, R. Cockett (1992) “Sequentializing programs defined by pattern matching”
• R. Cockett (1993) “Examples of Charity term logic proofs”
• M. Schroeder (1993) “Charity grammar”
• M. Schroeder (1993) “CHIRP: A front end for Charity”
• D. Spencer (1993) “Categorical programming with functorial strength”
• B. Yee (1993) “The CHARM project: A back end to the Charity interpreter”
• C. Tuckey (1994) “The implementation of pattern matching in Charity”
• B. Yee (1995) “Implementing the Charity abstract machine”
• R. Cockett (1996) “Charitable thoughts”
• T. Fukushima, C. Tuckey (1996) “Charity user manual” (final version)
• P. Vesely (1996) “Categorical combinators for Charity”
• M. Schroeder (1997) “Higher-order Charity”
• C. Tuckey (1997) “Pattern matching in Charity”
• P. Vesely (1997) “Typechecking the Charity term logic”
• M. Zeng (2003) “An implementation of Charity”

• R. Blute, R. Cockett, R. Seely, T. Trimble (1991) “Natural deduction and coherence for weakly distributive categories”
• R. Cockett, D. Spooner (1994) “SProc categorically”
• R. Cockett, D. Spooner (1995) “Categories for synchrony and asynchrony”
• R. Blute, R. Cockett, R. Seely, T. Trimble (1996) “Natural deduction and coherence for weakly distributive categories” (final version)
• R. Cockett, D. Spooner (1996) “Constructing process categories”
• R. Cockett, D. Spooner (1997) “Constructing process categories” (final version)
• R. Cockett, R. Seely (1997) “Proof theory for full intuitionistic linear logic, bilinear logic, and MIX categories”
• D. Spooner (1997) “Building process categories”

• Total functional programming
• Totally functional programming
• ET language

Packaged by Miëtek Bak.