Skip to main content
16 votes
Accepted

How can we define a denotational semantics for recursive functions?

One way to represent this kind of (computable) recursive function mathematically comes from domain theory. I will end up describing something called a Scott domain in this answer, named after Dana ...
David Young's user avatar
  • 2,257
13 votes
Accepted

What are denotational semantics, and what are they useful for?

You could have invented denotational semantics! Suppose you want to know if some property about a program or a programming language holds. For example, you might wish to know whether a static analysis ...
Alexis King's user avatar
  • 8,731
9 votes
Accepted

How can denotational semantics be defined for imperative statements?

Statements as Functions As suggested in coredump's comments, we generally interpret imperative statements as syntactic sugar for a function application. Side-effects are represented as usual in pure ...
Wheelwright's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible