Table of Contents:

• Part I
• Introduction to Part I
• What is this?
• Navigating the text
• The UA-Calculators,  Guide and Tutorial
• General Description of, and directions for, UA-Calculators
• Short description of special UA-Calculator operations for signatures

     and algebras
• Other Applications of UA-Calculators
• The UA-Calculator  Algebraic Operations In Detail
• Preliminaries
• Some typographic conventions
• Some basic notation
• Ordered Pairs
• Total and Partial Functions
• Strings
• S-ary sets and S-ary  mappings
• Commuting Diagrams
• Algebras, Signatures and Homomorphisms
• Informal Introduction
• Signatures
• Signatures on the UA-Calculators
• Algebras
• Algebras on the UA-Calculators
• Homomorphisms
• Initial Algebras
• Key Definitions and Results for Initial Algebras
• Initial Homomorphisms on the UA-Calculators
• Some First Applications of Initiality
• Trees over Signatures
• Free Algebras, Derived Operations and Substitution
• Context-free Grammars
• A Grammar for a Structured Programming Language, LANG1
• The Semantics of LANG1
• Parsing LANG1
• STACKM (= Stack Machine)
• Compiling LANG1 onto STACKM
• Index to Part I
• Part II
• The Limitations of LANG1 and of Context-free Grammars for programming languages
• Parameterized Grammars
• more to come