Abstract
An algebraic analogue to domain equations as known from denotational semantics is presented. A set of mutually recursive algebraic domain equations is roughly speaking a set of parameterized algebraic specifications applying instances of each other in a recursive fashion. The solution to a set of algebraic domain equations can be constructed by using a new parameter passing technique called recursive parameter passing. The theory also covers the notion of parameterized algebraic domain equations and it is shown that the result of successive actualization and recursive parameter passing is independent of the order. The specification method makes sense under an arbitrary institution.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
