Journal article 977 views
VDM semantics of programming languages: combinators and monads
Formal Aspects of Computing, Volume: 23, Issue: 2, Pages: 221 - 238
Swansea University Author:
Peter Mosses
Full text not available from this repository: check for access using links below.
DOI (Published version): 10.1007/s00165-009-0145-4
Abstract
The Vienna Development Method (VDM) was developed in the early 1970s as a variant of denotational semantics. VDM descriptions of programming languages differ from the original Scott–Strachey style by making extensive use of combinators which have a fixed operational interpretation. After recalling th...
| Published in: | Formal Aspects of Computing |
|---|---|
| ISSN: | 0934-5043 |
| Published: |
2010
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa5290 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
The Vienna Development Method (VDM) was developed in the early 1970s as a variant of denotational semantics. VDM descriptions of programming languages differ from the original Scott–Strachey style by making extensive use of combinators which have a fixed operational interpretation. After recalling the main features of denotational semantics and the Scott–Strachey style, we examine the combinators of the VDM specification language, and relate them to monads, which were introduced more than 15 years later. We also suggest that use of further monadic combinators in VDM could be beneficial. Finally, we provide an overview of published VDM semantic descriptions of major programming languages. |
|---|---|
| College: |
Faculty of Science and Engineering |
| Issue: |
2 |
| Start Page: |
221 |
| End Page: |
238 |