Programming Language Theory

2.

Mathematical Foundations

2.1.

2.1.1.

Propositional Logic

2.1.1.1.

Syntax and Formation Rules

2.1.1.2.

Semantics and Truth Conditions

2.1.1.3.

2.1.1.4.

Logical Connectives

2.1.1.5.

Tautologies and Contradictions

2.1.2.

Predicate Logic

2.1.2.1.

2.1.2.2.

Variables and Domains

2.1.2.3.

Logical Inference Rules

2.1.2.4.

2.1.3.

2.1.3.1.

Natural Deduction

2.1.3.1.1.

Introduction Rules

2.1.3.1.2.

Elimination Rules

2.1.3.1.3.

2.1.3.2.

Sequent Calculus

2.1.3.2.1.

Sequent Structure

2.1.3.2.2.

Structural Rules

2.1.3.2.3.

2.2.

Set Theory and Relations

2.2.1.

Basic Set Operations

2.2.2.

Functions and Mappings

2.2.2.1.

Partial Functions

2.2.2.2.

Total Functions

2.2.2.3.

Injective and Surjective Functions

2.2.3.

Relations and Properties

2.2.3.1.

2.2.3.2.

2.2.3.3.

2.2.3.4.

Equivalence Relations

2.3.

Mathematical Induction

2.3.1.

Principle of Mathematical Induction

2.3.2.

Structural Induction

2.3.3.

Inductive Definitions

2.3.4.

Inductive Proofs for Language Properties

2.4.

Formal Languages and Automata

2.4.1.

Regular Languages

2.4.1.1.

Regular Expressions

2.4.1.2.

Deterministic Finite Automata

2.4.1.3.

Nondeterministic Finite Automata

2.4.1.4.

Equivalence of Representations

2.4.2.

Context-Free Languages

2.4.2.1.

Context-Free Grammars

2.4.2.2.

Parse Trees and Derivations

2.4.2.3.

Pushdown Automata

2.4.2.4.

Parsing Algorithms

Previous

1. Introduction to Programming Language Theory

Go to top

Next

3. Lambda Calculus