A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Usual algebraic specification techniques can be extended to treat partially ordered sorts. This allows the introduction of sub-and supersorts as well as overloaded operators, while pleasant features (e.g. existence of initial algebras and equivalence of algebraic and operational semantics) of the equational specification method are preserved. On this basis error and exception handling is studied. For each sort an ok and an error subsort is introduced and clean algebras (i.e. algebras which aredoi:10.1007/3-540-17660-8_49 fatcat:ngbehnrxsje55fq6ej6jvfaqvy