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.
Highly Cited
2015
Highly Cited
2015
link, similar to dependency representations in computational lingusitics. Here we show a categorial grammar-style derivation 
Highly Cited
2005
Highly Cited
2005
We present a denotational semantics for Stateflow, the graphical Statecharts-like language of the Matlab/Simulink toolsuite. This… 
Highly Cited
2005
Highly Cited
2005
We introduce an expressive yet semantically clean core Java-like language, Java JR, and provide it with a formal operational… 
Highly Cited
2004
Highly Cited
2004
Continuous queries over data streams are an important new class of queries motivated by a number of applications [BBD<sup>+</sup… 
Highly Cited
2002
Review
2001
Review
2001
This paper presents a semi-formal overview of the most important topics from the theory of denotational semantics. The emphasis… 
Highly Cited
1984
Highly Cited
1984
A denotational semantics is given for a large subset of occam, a programming language for concurrent systems. The semantic domain… 
Highly Cited
1983
Highly Cited
1983
Given a set of processes and a set of tests on these processes we show how to define in a natural way three different… 
Highly Cited
1982
Highly Cited
1982
A general framework for the denotational treatment of concurrency is introduced. The key idea is the notion of process which is… 
Highly Cited
1980
Highly Cited
1980
A methodology is described for generating provably correct compilers from denotational definitions of programming languages. An…