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. A solution to a set of algebraic domain equations can be constructed by using a new parameter passing technique called recursive parameter passing. The specification method makes sense under an arbitrary institution.
| Original language | English |
|---|
| Publisher | Technical University of Denmark |
|---|---|
| Number of pages | 32 |
| Publication status | Published - 1988 |
Bibliographical note
ID-TR: 1988-41ISSN 0902-2821
Fingerprint
Dive into the research topics of 'Mutually Recursive Algebraic Specifications'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver