From Operational to Denotational Semantics

From Operational to Denotational Semantics (1989)

Cached

Download Links

[condor.cs.jhu.edu]

Other Repositories/Bibliography

DBLP

by Scott Smith

Venue:	In MFPS 1991
Citations:	17 - 6 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	From Operational to Denotational Semantics	user correction - Legacy Corrections
AUTHOR NAME	Scott Smith	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; The Johns Hopkins University	user correction - Legacy Corrections
AUTHOR ADDR	Baltimore, MD 21218	user correction - Legacy Corrections
ABSTRACT	In this paper it is shown how operational semantic methods may be naturally extended to encompass many of the concepts of denotational semantics. This work builds on the standard development of an operational semantics as an interpreter and operational equivalence. The key addition is an operational ordering on sets of terms. From properties of this ordering a closure construction directly yields a fully abstract continuous cpo model. Furthermore, it is not necessary to construct the cpo, for principles such as soundness of fixed-point induction may be obtained by direct reasoning from this new ordering. The end result is that traditional denotational techniques may be applied in a purely operational setting in a natural fashion, a matter of practical importance for developing semantics of realistic programming languages. 1 Introduction This paper aims to accomplish a degree of unification between operational and denotational approaches to programming language semantics by recasting d...	user correction - Legacy Corrections
YEAR	1989	user correction - Legacy Corrections
VENUE	In MFPS 1991	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	54--76	INFERENCE
VOLUME	598	INFERENCE
CITATIONS	20 found	ParsCit 1.0