Topic
Denotational semantics
About: Denotational semantics is a research topic. Over the lifetime, 4742 publications have been published within this topic receiving 131223 citations. The topic is also known as: Scott–Strachey semantics (initially) & mathematical semantics (initially).
Papers published on a yearly basis
Papers
More filters
•
01 Jan 1988
TL;DR: This paper introduces a succinct abstract representation of constraint atoms in which a constraint atom is represented compactly and shows that this representation provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended.
3,539 citations
•
2,380 citations
••
TL;DR: This paper presents the imperative primitives of E esterel and the temporal manipulations they permit, and shows how the E Esterel v2 and V3 compilers efficiently translate concurrent E esteretl programs into efficient equivalent sequential automata that can be implemented in conventional sequential languages.
1,817 citations
•
[...]
TL;DR: In this paper, the Curry-Howard isomorphism and the normalisation theorem of a natural deduction system T coherence spaces have been studied in the context of linear logic and linear logic semantics.
Abstract: Sense, denotation and semantics natural deduction the Curry-Howard isomorphism the normalisation theorem Godel's system T coherence spaces denotational semantics of T sums in natural deduction system F coherence semantics of the sum cut elimination (Hauptsatz) strong normalisation for F representation theorem semantics of System F what is linear logic?
1,771 citations
••
TL;DR: In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics.
Abstract: Sentences in first-order predicate logic can be usefully interpreted as programs. In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated. It is concluded that operational semantics is a part of proof theory and that fixpoint semantics is a special case of model-theoretic semantics.
1,636 citations