On parametric algebraic specifications with clean error handling [chapter]

Martin Gogolla
1987 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 are
more » ... k/errorconsistent and ok/error-complete)are considered. This new approach allows to prove an extension lemma for persistent parametric specifications which permit error handling. opment of specification languages like OBJ [FGJM 85], ACT ONE [EFH 83], ASL [SW 83] and many others.
doi:10.1007/3-540-17660-8_49 fatcat:ngbehnrxsje55fq6ej6jvfaqvy