Implementing Parameterized Type Algorithm Definitions in Mathematica

The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advantage of systematically dealing with domains, categories, operators over them by creating general contexts of expressing algorithms, which can be applied by parameterizing them with various domains, using the same algorithm definition. While similar approaches have been previously presented by the author, the present paper aims at a stronger focus on algorithm characteristics defined on categorical principles and giving a more general framework for implementing Mathematica algorithms based on generic principles and category theory. The paper also discusses run time efficiency aspects for these generic implementations.

• Type: Conference
• Year: 2006
• Where: SYNASC
• Authors: Alina Andreica
• Keywords: Algorithms, Category Theory, Parameterized Type Categories, SYNASC 2006