Denotational Semantics and Refinement

Denotational descriptions are frequently presented in terms of a sequence of descriptions of programming languages of increasing complexity. We discuss a formal approach to the study of such description sequences in terms of a refinement relation, showing how the informal use made of this approach in tutorial introductions to denotational semantics may be formally justified.

Content

Author and article information

Conference

Publication date: September 1997

Publication date (Print): September 1997

Pages: 1-14

Affiliations

[0001]Centre for Software Reliability, Department of Computing Science, University of Newcastle Upon Tyne

Newcastle Upon Tyne, UK

[0002]School of Mathematical Sciences, University of Bath

Bath, UK

Article

DOI: 10.14236/ewic/FM1997.11

SO-VID: 8fc1b9e5-4c74-46c4-bd3b-f047ef4b11d8

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Proceedings of the 1st Irish Workshop on Formal Methods

Conference acronym: FM

Conference number: 1

Conference location: Dublin

Conference date: 3-4 July 1997

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Irish Workshop on Formal Methods

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/FM1997.11

Self URI (journal page): https://ewic.bcs.org/

Studying business & IT? Drive your professional career forwards with BCS books - for a 20% discount click here: shop.bcs.org

Denotational Semantics and Refinement

Abstract