Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2001
Highly Cited
2001
Abstract We extend to the exponential connectives of linear logic the study initiated in Bucciarelli and Ehrhard (Ann. Pure. Appl… Expand
Is this relevant?
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… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Abstract We present the E sterel programming language which is especially designed to program reactive systems, that is systems… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
  • E. Moggi
  • Inf. Comput.
  • 1991
  • Corpus ID: 12767331
Abstract The λ-calculus is considered a useful mathematical tool in the study of programming languages, since programs can be… Expand
  • table 1
  • table 2
  • table 3
  • table 5
  • table 6
Is this relevant?
Highly Cited
1990
Highly Cited
1990
  • P. Mosses
  • Handbook of Theoretical Computer Science, Volume…
  • 1990
  • Corpus ID: 37671785
Publisher Summary This chapter focuses on denotational semantics, which is a framework for the formal description of programming… Expand
Is this relevant?
Highly Cited
1984
Highly Cited
1984
Abstract Given a set of processes and a set of tests on these processes we show how to define in a natural way three different… Expand
  • table 1
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
From the Publisher: "First book-length exposition of the denotational (or `mathematical' or `functional') approach to the formal… Expand
Is this relevant?
Highly Cited
1980
Highly Cited
1980
 
Is this relevant?