Useful Links
Computer Science
Programming
Programming Language Theory
1. Introduction to Programming Language Theory
2. Mathematical Foundations
3. Lambda Calculus
4. Syntax and Parsing
5. Formal Semantics
6. Type Systems
7. Programming Language Features
8. Implementation Strategies
9. Advanced Topics
Mathematical Foundations
Formal Logic
Propositional Logic
Syntax and Formation Rules
Semantics and Truth Conditions
Truth Tables
Logical Connectives
Tautologies and Contradictions
Predicate Logic
Quantifiers
Variables and Domains
Logical Inference Rules
Satisfiability
Proof Systems
Natural Deduction
Introduction Rules
Elimination Rules
Proof Trees
Sequent Calculus
Sequent Structure
Structural Rules
Logical Rules
Set Theory and Relations
Basic Set Operations
Functions and Mappings
Partial Functions
Total Functions
Injective and Surjective Functions
Relations and Properties
Reflexivity
Symmetry
Transitivity
Equivalence Relations
Mathematical Induction
Principle of Mathematical Induction
Structural Induction
Inductive Definitions
Inductive Proofs for Language Properties
Formal Languages and Automata
Regular Languages
Regular Expressions
Deterministic Finite Automata
Nondeterministic Finite Automata
Equivalence of Representations
Context-Free Languages
Context-Free Grammars
Parse Trees and Derivations
Pushdown Automata
Parsing Algorithms
Previous
1. Introduction to Programming Language Theory
Go to top
Next
3. Lambda Calculus