A Type-Coercion Problem in Computer Algebra

Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system are polymorphism and coercion between types. Recently the use of order-sorted rewrite systems was proposed as a general framework. We will give a quite simple example of a family of types arising in computer algebra whose coercion relations cannot be captured by a finite set of first-order rewrite rules.

• Type: Conference
• Year: 1992
• Where: AISC
• Authors: Andreas Weber
• Keywords: AISC 1992, Artificial Intelligence, First-order Rewrite Rules, Order-sorted Rewrite Systems, Type Inference