Implementing Parameterized Type Algorithm Definitions in Mathematica

  • Alina Andreica
  • Published 2006 in
    2006 Eighth International Symposium on Symbolic…

Abstract

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… (More)
DOI: 10.1109/SYNASC.2006.45

1 Figure or Table

Topics

  • Presentations referencing similar topics