Programming Language Theory

5.

Formal Semantics

5.1.

Semantic Approaches Overview

5.1.1.

Purpose of Formal Semantics

5.1.2.

Comparison of Methods

5.1.3.

Choosing Appropriate Approaches

5.2.

Operational Semantics

5.2.1.

Small-Step Semantics

5.2.1.1.

Transition Relations

5.2.1.2.

Configuration Spaces

5.2.1.3.

Evaluation Rules

5.2.1.4.

5.2.2.

Big-Step Semantics

5.2.2.1.

Evaluation Relations

5.2.2.2.

Derivation Trees

5.2.2.3.

Termination Properties

5.2.3.

Evaluation Contexts

5.2.3.1.

Context Definition

5.2.3.2.

Contextual Evaluation Rules

5.2.3.3.

Reduction Strategies

5.3.

Denotational Semantics

5.3.1.

Mathematical Meanings

5.3.1.1.

Semantic Functions

5.3.1.2.

Compositional Structure

5.3.2.

5.3.2.1.

5.3.2.2.

Complete Partial Orders

5.3.2.3.

Continuous Functions

5.3.2.4.

5.3.3.

Semantic Domains

5.3.3.1.

5.3.3.2.

Function Spaces

5.3.3.3.

Product Domains

5.3.3.4.

5.3.4.

Recursive Definitions

5.3.4.1.

Fixed-Point Semantics

5.3.4.2.

Least Fixed Points

5.4.

Axiomatic Semantics

5.4.1.

Program Specification

5.4.1.1.

5.4.1.2.

5.4.1.3.

Program Properties

5.4.2.

5.4.2.1.

5.4.2.2.

Inference Rules

5.4.2.3.

Partial Correctness

5.4.2.4.

Total Correctness

5.4.3.

Weakest Preconditions

5.4.3.1.

Predicate Transformers

5.4.3.2.

Calculation Methods

Previous

4. Syntax and Parsing

Go to top

Next

6. Type Systems