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
2009
Highly Cited
2009
We present a Coq formalization of constructive *** -cpos (extending earlier work by Paulin-Mohring) up to and including the… 
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… 
2004
2004
We present a denotational semantics for agent deliberation dialogues, i.e., dialogues over proposed actions, conducted under a… 
Highly Cited
2001
Highly Cited
2001
The dilemma encountered in the design of an agent communication language (ACL) for an open society is that it should be based on… 
1999
1999
This chapter presents a dynamic denotational semantics of the Java programming language. This semantics covers almost the full… 
Review
1996
Review
1996
This paper surveys the work of many researchers on rewriting logic since it was first introduced in 1990. The main emphasis is on… 
1991
1991
We propose an incremental approach to the denotational semantics of complex programming languages based on the idea of monad… 
1989
1989
Denotational Semantics is a framework for the formal description of programming language semantics. The main idea of Denotational… 
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…