A set-theoretic semantics for Clear

@article{Sannella2004ASS,
  title={A set-theoretic semantics for Clear},
  author={Donald Sannella},
  journal={Acta Informatica},
  year={2004},
  volume={21},
  pages={443-472}
}
  • Donald Sannella
  • Published 2004
  • Computer Science
  • Acta Informatica
  • SummaryA semantics for the Clear specification language is given. The language of set theory is employed to present constructions corresponding to Clear's specification-combining operations, which are then used as the basis for a denotational semantics. This is in contrast to Burstall and Goguen's 1980 semantics which described the meanings of these operations more abstractly via concepts from category theory. 

    Topics from this paper.

    Citations

    Publications citing this paper.