Skip to main content
Computer Science

Questions tagged [denotational-semantics]

Ask Question

The tag has no summary.

35 questions
Newest Active Bountied Unanswered
1 vote
0 answers
114 views

(I cross-posted this on Math SE because the answering rate is relatively slower here, and I was really desperate for any suggestions If you feel the post on math SE misses any good material or sources,...
Aditya Mishra's user avatar
  • 141
1 vote
0 answers
32 views

I just watched ZJU Global Dialogue Series: Programming Language Semantics by Prof. Andrew Pitts, and one slide looks like this: Styles of semantics Program logics Operational semantics Denotational ...
Enlico's user avatar
  • 137
3 votes
0 answers
221 views

All of the discussion is in the context of this paper. I think that the whole procedure that the paper describes is not decidable, because if we can have an algorithm for it, then we can solve halting ...
Senmorta's user avatar
  • 31
4 votes
0 answers
89 views

A denotational semantic for the lambda calculus can be given by solving the domain equation $$ D \simeq [D →_c D]_\bot $$ in the category of $\omega$-complete CPOs, where $→_c$ denotes the space of $\...
Joachim Breitner's user avatar
  • 290
2 votes
1 answer
1k views

I saw the word "redex" in the context of proramming language theory/semantics in 2018 and now when I was reading a neurosymbolic research paper (machine learning with neural nets + symbolic ...
Charlie Parker's user avatar
  • 3,124
2 votes
1 answer
161 views

In "Syntax and Semantics of Dependent Types" at the top of page 24, Martin Hoffman describes $\mathit{Ty}_{\mathcal C}(\Gamma)$ as the collection of semantic types under context $\Gamma$. It ...
Kevin Clancy's user avatar
  • 173
2 votes
0 answers
322 views

At section 5.2 of 2000’s republication of 1974’s paper ‘Continuations: A Mathematical Semantics for Handling Full Jumps’ by Christopher Strachey and Christopher Wadsworth, the following denotational ...
Géry Ogam's user avatar
  • 113
1 vote
0 answers
86 views

I am working with a toy programming language for my thesis. It is lazy evaluating so I can have infinite terms (for example the "infinite natural number" ...
Lucas's user avatar
  • 111
0 votes
1 answer
429 views

Can we formalize the operational/denotational semantics of a Turing Machine? Is there any formalization in literature?
Linpeng Zhang's user avatar
  • 19
0 votes
0 answers
56 views

Moved from cstheory.stackexchange upon request Winskel, in his book The formal semantics of programming languages, on page 58, writes: C[c0;c1] = C[c1] o C[c0] a composition of relations, the ...
Gergely's user avatar
  • 409
2 votes
1 answer
119 views

I am trying to understand what is the domain for denotational semantics. Right now the way I understand denotational semantics is that given some syntax of a program that maps to some mathematical ...
Charlie Parker's user avatar
  • 3,124
11 votes
1 answer
11k views

Recap of the terms from the dictionary: semantics: the study of meaning in a language (words, phrases, etc) and of language constructs in programming languages (basically any syntactically valid part ...
George's user avatar
  • 213
3 votes
2 answers
522 views

I was going through these notes and they have the following operator on partial functions: $$ \mathcal F^{k}(\bot)(\sigma) = \left\{ \begin{array}{ll} \alpha( [\![s]\!]\sigma ) & [\![b]\!]\...
Charlie Parker's user avatar
  • 3,124
1 vote
2 answers
367 views

I was reading about denotational semantics Broadly speaking, denotational semantics is concerned with finding mathematical objects called domains that represent what programs do. For example, ...
Charlie Parker's user avatar
  • 3,124
3 votes
0 answers
94 views

Has "top" ($\top$) been removed from or relegated to a much more minor role in denotational semantics? If so, when and why? I see older papers and books talking about both "top" and "bottom" ("bot", $...
joeA's user avatar
  • 139

15 30 50 per page
1
2 3