http://hdl.handle.net/1880/45289 2013-05-20T11:57:39Z 2013-05-20T11:57:39Z Fukushima, Tom Cockett, Robin http://hdl.handle.net/1880/45460 2008-02-27T09:40:35Z 1992-06-01T00:00:00Z

Title: ABOUT CHARITY Authors: Fukushima, Tom; Cockett, Robin Abstract: Charity is a categorical programming language based on distributive categories (in the sense of Schanuel and Lawvere) with strong datatypes (in the sense of Hagino). Distributive categories come with a term logic which can express most standard programs; and they are fundamental to computer science because they permit proof by case analysis and, when strong datatypes are introduced, proof by structural induction. Charity is functional and polymorphic in style, and is strongly normalizing. As a categorical programming language it provides a unique marriage of computer science and mathematical thought. The above aspects are particularly important for the production of verified programs as the naturality of morphisms gives us ``theorems for free'', termination proofs are not required, and mathemathical specifications can be used.

1992-06-01T00:00:00Z Cockett, J. R. B. Hofstra, P. J. W. http://hdl.handle.net/1880/45459 2008-02-27T09:40:33Z 2006-10-31T00:00:00Z

Title: An introduction to partial lambda algebras Authors: Cockett, J. R. B.; Hofstra, P. J. W. Abstract: The purpose of this paper is to give an exposition of the theory of partial combinatory algebras, models of the partial lambda calculus and various related concepts from the point of view of restriction categories. We feel that restriction categories not only simplify and clarify the presentation of the subject matter, but also provide us with precisely the right type of logic to reason about the structures involved.

2006-10-31T00:00:00Z