includes bibliography and index

I. Introduction. 1. The role of programming languages. Toward higher-level languages.problems of scale.programming paradigms.language implementation: bridging the gap.exercises.bibliographic notes.2. Language description: syntactic structure. Expression notations.abstract syntax trees.lexical syntax.context-free grammars.grammars for expressions.variants of grammars.exercises.bibliographic notes.ii. Imperative programming. 3. Statements: structured programming. The need for structured programming.syntax-directed control flow.design considerations: syntax.handling special cases in loops.programming with invariants.proof rules for partial correctness.control flow in c.exercises.bibliographic notes.4. Types: data representation. The role of types.basic types.arrays: sequences of elements.records: named fields.unions and variant records.sets.pointers: efficiency and dynamic allocation.two string tables.types and error checking.exercises.bibliographic notes.5. Procedure activations. Introduction to procedures.parameter-passing methods.scope rules for names.nested scopes in the source text.activation records.lexical scope: procedures as in c.lexical scope: nested procedures and pascal.exercises.bibliographic notes.iii. Object-oriented programming. 6. Groupings of data and operations. Constructs for program structuring.information hiding.program design with modules.modules and defined types.class declarations in c++.dynamic allocation in c++.templates: parameterized types.implementation of objects in c++.exercises.bibliographic notes.7. Object-oriented programming. What is an object?object-oriented thinking.inheritance.object-oriented programming in c++.an extended c++ example.derived classes and information hiding.objects in smalltalk.smalltalk objects have a self.exercises.bibliographic notes.iv. Functional programming. 8. Elements of functional programming. A little language of expressions.types: values and operations.function declarations.approaches to expression evaluation.lexical scope.type checking.exercises.bibliographic notes.9. Functional programming in a typed language. Exploring a list.function declaration by cases.functions as first-class values.ml: implicit types.data types.exception handling in ml.little quilt in standard ml.exercises.bibliographic notes.10. Functional programming with lists. Scheme, a dialect of lisp.the structure of lists.list manipulation.a motivating example: differentiation.simplification of expressions.storage allocation for lists.exercises.bibliographic notes.v. Other paradigms. 11. Logic programming. Computing with relations.introduction to prolog.data structures in prolog.programming techniques.control in prolog.cuts.exercises.bibliographic notes.12. An introduction to concurrent programming. Parallelism in hardware.streams: implicit synchronization.concurrency as interleaving.liveness properties.safe access to shared data.concurrency in ada.synchronized access to shared variables.exercises.bibliographic notes.vi. Language description. 13. Semantic methods. Synthesized attributes.attribute grammars.natural semantics.denotational semantics.a calculator in scheme.lexically scoped lambda expressions.an interpreter.an extension: recursive functions.exercises.bibliographic notes.14. Static types and the lambda calculus. Equality of pure lambda terms.substitution revisited.computation with pure lambda terms.programming constructs as lambda-terms.the typed lambda calculus.polymorphic types.exercises.bibliographic notes.15. A look at some languages. Pascal: a teaching language.c: systems programming.c++: a range of programming styles.smalltalk, the language.standard ml.scheme, a dialect of lisp.prolog.bibliography. Credits. Index.