Skip to search formSkip to main contentSkip to account menu

Denotational semantics

Known as: Scott–Strachey semantics, Full completeness, Fully abstract 
In computer science, denotational semantics (initially known as mathematical semantics or Scott–Strachey semantics) is an approach of formalizing the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1998
1998
Abstract. From an arbitrary temporal logic institution we show how to set up the corresponding institution of objects. The main… 
1997
1997
  • W. Yeung
  • 1997
  • Corpus ID: 12021236
This paper discusses the use of denotational semantics in formalizing the notations of structured methods. Using the Jackson… 
1993
1993
This papergives an untimed denotational smulhticsfor the concurrent programming langUllge occam 2. It draws heDvilg on the… 
Highly Cited
1990
Highly Cited
1990
  • C. ParkA. Shaw
  • 1990
  • Corpus ID: 44613339
A timing tool has been implemented for a subset of C as an initial experiment in validating a methodology for predicting the… 
1988
1988
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and related to an operational… 
1983
1983
We show how one of Nilsson's tenets on rule-based production systems, when applied to Horn clause programs, leads to a… 
1981
1981
This paper describes a method for giving structured algebraic denotational definitions of programming language semantics. The… 
Review
1980
Review
1980
  • H. Ganzinger
  • 1980
  • Corpus ID: 19470970
I t is generally accepted that, in order to reason about programs, a formal de f in i t i on of the semantics of the programming… 
1979
1979
This paper studies the denotational semantics of programming language constructs whose operational semantics require interleaving… 
1975
1975
"Obviously true" properties of programs can be hard to prove when meanings are specified with a denotational semantics. One cause…