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.
Review
2004
Review
2004
Part I: Introduction. Chapter 1: Introduction to Modeling and Simulation. Chapter 2: A Quick Tour of Modelica. Part II: The… 
Highly Cited
1997
Highly Cited
1997
  • D. Turi, G. Plotkin
  • Proceedings of Twelfth Annual IEEE Symposium on…
  • 1997
  • Corpus ID: 13268853
We present a categorical theory of 'well-behaved' operational semantics which aims at complementing the established theory of… 
Highly Cited
1994
Highly Cited
1994
This paper will focus on the semantic representation of verbs in computer systems and its impact on lexical selection problems in… 
Highly Cited
1993
Highly Cited
1993
Semantics of Programming Languages exposes the basic motivations and philosophy underlying the applications of semantic… 
Highly Cited
1992
Highly Cited
1991
Highly Cited
1991
  • E. Moggi
  • Inf. Comput.
  • 1991
  • Corpus ID: 12767331
Highly Cited
1982
Highly Cited
1982
The purpose of the theory of domains is to give models for spaces on which to define computable functions. The kinds of spaces… 
Highly Cited
1980
Highly Cited
1980
Review
1976
Review
1976
This paper is a tutorial introduction to the theory of programming language semantics developed by D. Scott and C. Strachey. The…