A Rewrite-Based Type Discipline for a Subset of Computer Algebra

@article{ComonLundh1991ART,
  title={A Rewrite-Based Type Discipline for a Subset of Computer Algebra},
  author={Hubert Comon-Lundh and Denis Lugiez and Philippe Schnoebelen},
  journal={J. Symb. Comput.},
  year={1991},
  volume={11},
  pages={349-368}
}
This paper is concerned with the type structure of a system including polymorphism, type properties and subtypes. This type system originates from computer algebra but it is not intended to be the solution of all type problems in this area. Types (or sets of types) are denoted by terms in some order-sorted algebra.:[: We consider a rewrite relation in this algebra, which is intended to express subtyping. The relations between the semantics and the axiomatization are investigated. It is shown… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 24 references

A Semantics for Polymorphic Subtypes in Computer Algebra

  • Sehnoebelen, Ph, D. Lugiez, H. Comon
  • 1988

Computational Aspects of an Order-Sorted Logic with Term Declarations

  • M. Schmidt-Schauss
  • PhD
  • 1988

On the design of the Scratchpad II interpreter

  • R. D. Jenks, R. S. Sutor
  • Lecture presented at
  • 1987

Order-Sorted Algebra I: Partial and Overloaded Operators, Errors

  • J. A. Goguen, J. Meseguer
  • 1987
1 Excerpt

Type inference in computer algebra

  • H. Comon, D. Lugiez, Schnoebelen, Ph.
  • Lecture presented at
  • 1987
1 Excerpt

Unification in an Order-Sorted Calculus with Declarations

  • M. Schmidt-Schauss
  • 1987

Similar Papers

Loading similar papers…