- Applied mathematics
- >
- Mathematical modeling
- >
- Formal specification languages
- >
- Denotational semantics

- Applied mathematics
- >
- Mathematical modeling
- >
- Models of computation
- >
- Denotational semantics

- Applied mathematics
- >
- Theoretical computer science
- >
- Logic in computer science
- >
- Denotational semantics

- Applied mathematics
- >
- Theoretical computer science
- >
- Mathematics of computing
- >
- Denotational semantics

- Fields of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Denotational semantics

- Formal methods
- >
- Formal specification
- >
- Formal specification languages
- >
- Denotational semantics

- Mathematical logic
- >
- Logic in computer science
- >
- Programming language semantics
- >
- Denotational semantics

- Mathematics of computing
- >
- Formal methods
- >
- Models of computation
- >
- Denotational semantics

- Mathematics of computing
- >
- Logic in computer science
- >
- Programming language semantics
- >
- Denotational semantics

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Denotational semantics

- Theoretical computer science
- >
- Formal methods
- >
- Models of computation
- >
- Denotational semantics

- Theoretical computer science
- >
- Logic in computer science
- >
- Programming language semantics
- >
- Denotational semantics

- Theoretical computer science
- >
- Mathematics of computing
- >
- Logic in computer science
- >
- Denotational semantics

- Theoretical computer science
- >
- Theory of computation
- >
- Models of computation
- >
- Denotational semantics

Actor model theory

In theoretical computer science, Actor model theory concerns theoretical issues for the Actor model. Actors are the primitives that form the basis of the Actor model of concurrent digital computation.

Denotational semantics of the Actor model

The denotational semantics of the Actor model is the subject of denotational domain theory for Actors. The historical development of this subject is recounted in [Hewitt 2008b].

Strict function

In computer science and computer programming, a function f is said to be strict if, when applied to a non-terminating expression, it also fails to terminate. A strict function in the denotational sema

Denotational semantics

In computer science, denotational semantics (initially known as mathematical semantics or Scottâ€“Strachey semantics) is an approach of formalizing the meanings of programming languages by constructing

Divergence (computer science)

In computer science, a computation is said to diverge if it does not terminate or terminates in an exceptional state. Otherwise it is said to converge. In domains where computations are expected to be

Unbounded nondeterminism

In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a request can become unbounded as a result of arbitratio

Power domains

In denotational semantics and domain theory, power domains are domains of nondeterministic and concurrent computations. The idea of power domains for functions is that a nondeterministic function may

Â© 2023 Useful Links.