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.
2007
2007
Web Services have become more and more important in these years, and BPEL4WS (BPEL) is a de facto standard for the web service… 
1998
1998
Abstract. From an arbitrary temporal logic institution we show how to set up the corresponding institution of objects. The main… 
1997
1997
A crucial aspect of the architecture of a software system is its decomposition into components and the specification of component… 
1994
1994
The thesis describes the production of a large prototype proof system for Z, and a tactic language in which the proof tactics… 
1993
1993
This papergives an untimed denotational smulhticsfor the concurrent programming langUllge occam 2. It draws heDvilg on the… 
1989
1989
This extension of the Lucid language seeks a high-level, real-time software-oriented tool with a formal mathematical semantics in… 
1989
1983
1983
We show how one of Nilsson's tenets on rule-based production systems, when applied to Horn clause programs, leads to a… 
1980
1980
Omega is a description system for knowledge embedding which combines mechanisms of the predicate calculus, type systems, and… 
1975
1975
"Obviously true" properties of programs can be hard to prove when meanings are specified with a denotational semantics. One cause…