A set-theoretic semantics for Clear
type: Item
instance of: scholarly article
title: A set-theoretic semantics for Clear
zbMATH Open document ID: 0535.68040
DOI: 10.1007/BF00271641
published in: Acta Informatica
publication date: 1984-01-01T00:00:00Z
review text: A 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.
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 3850492
zbMATH Keywords: semantics for the Clear specification language
zbMATH Keywords: denotational semantics
author: Donald Sannella
MaRDI profile type: Publication
cites work: R for Semantics
cites work: Programming in a wide spectrum language: A collection of examples
cites work: Partial abstract types
cites work: Q3906394
cites work: Q3341871
cites work: Q3667933
cites work: Q3668831
cites work: Q4151143
cites work: Q5416166
cites work: Report on the Larch shared language
cites work: Abstract data types and software validation
cites work: The IOTA programming system. A modular programming environment
cites work: Q3923580
cites work: Q3042444
cites work: Q3954805
cites work: Q3666260
description: scientific article; zbMATH DE number 3850492