Operational Semantics for Order-Sorted Algebra

@inproceedings{Goguen1985OperationalSF,
  title={Operational Semantics for Order-Sorted Algebra},
  author={Joseph A. Goguen and Jean-Pierre Jouannaud and Jos{\'e} Meseguer},
  booktitle={ICALP},
  year={1985}
}
generalized many basic results of standard many-sorted algebra to OSA, and [9] simplified and generalized [6]; [5] gives a slightly more complex and less general simplification. [9] also gives sound and complete rules of deduction for OSA, introduces the important concept of =sort constraint =, and reduces OSA to standard conditional many-sorted algebra, thus automatically lifting conditional many-sorted algebra results to OSA. After reviewing this, we present here a rewrite rule-based… CONTINUE READING

References

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

Initiality, Induction and Computability

  • J. Meseguer, J. A. Goguen
  • In Algebraic Methods in Semantics,
  • 1985
3 Excerpts

Order-Sorted Algebra I: Partial and Overloaded Operations, Errors and Inheritance

  • J. Goguen, J. Meseguer
  • To appear, SRI International,
  • 1985
2 Excerpts

Equational Partiality

  • K. Benecke, H. Reichet
  • In Algebra Universalis,
  • 1984
1 Excerpt

Algebraic Specifications with Partially Ordered Sorts and Declarations

  • M. Gogolla
  • 1983
1 Excerpt

Deduction with Many-Sorted Rewrite Rules

  • J. Meseguer, J. Goguen
  • Technical Report, SRI International,
  • 1983
1 Excerpt

Similar Papers

Loading similar papers…