• Michael L. Scott, Programming Language Pragmatics, 2nd Edition, Morgan-Kaufmann, 2006.
• Excerpts from David A. Watt, Programming Language Syntax and Semantics, Prentice-Hall, 1997. Available from Student Union FAST COPY (621-5306)

For Everybody: All students are required to fill out the web page entitled Account Service Request at URL www.cs.arizona.edu/~apply. Do so whether or not you already have an account, and whether you are a Computer Science major or not. (This updates a Department database with your course selections, and so you can be assigned a correct Computer Science ID (CSID) number).

Here is how to proceed:

For a student with a currently active account in C SC: At the web page, under Select the Action Desired, select UPDATE an OPEN account for new classes. Fill in other requested information. Read the Appropriate Use Guidelines at www.cs.arizona.edu/policies/computing.html before pushing ACCEPT.

For a student without a currently active account in C SC: To obtain a new account on the Department's instructional processor lectura, or to re-activate an existing account, use any machine to go to URL www.cs.arizona.edu/~apply. (During the first week of classes, the Department provides machines for this purpose in Room 930 Gould-Simpson Bldg.) At the web page, under Select the Action Desired, select either NEW account on CS systems, or RE-activate an EXISTING closed CS account. Fill in other requested information. Read the Appropriate Use Guidelines at www.cs.arizona.edu/policies/computing.html before pushing ACCEPT. Your registration information will be verified within a few minutes, and an account will be created for you, along with a keycard allowing round-the-clock lab access. The keycard will be available in Room 930 while the account registration machines are set up there, and thereafter at the Reception Desk in Academic Services, Room 917.

For Everybody: You will need to know your CSID. To find your CSID at any time, go to www.cs.arizona.edu/computing/services/csid.html. Enter your 9-digit Student ID (SID) without any hyphens, and push the submit button. Record your CSID for future reference. Grades will be posted using your CSID.

Note: Over the summer, all "old style" SIDs (UA Student IDs) that were based on social security numbers were replaced with new SIDs. Since CSIDs are based on SIDs, if your SID has changed, then so has your CSID. Please go to the above URL to discover your new CSID.

Students who have had an SID change must provide their new SID and CSID in order to perform any web-based account service at https://www.cs.arizona.edu/computing/services/

Each graded item, such as a homework or examination, is first awarded a raw score; raw scores vary with the number of questions, their difficulty, and their length. For each graded item, the raw score is normalized to a ``traditional'' scale in which 90 - 100 is an A, 80 - 89 is a B and 70 - 79 is a C. For each graded item, only the normalized score is recorded. The final cumulative course grade is computed as a weighted average of these normalized scores, using the weights described under Course Format above. The resulting weighted average is then converted to a letter grade using the ``traditional'' scale. Decisions on whether borderline scores (such as 89) will be recorded as the next highest letter grade will be made using (a) performance on the final examination and (b) evidence of accomplishment in the subject that is cumulative over the term.

Any appeal to the instructor to review or reconsider a graded item must be made within a week of the graded item being handed back in class.

Attendance is not enforced, but you are responsible for all material covered in lecture or assigned as reading.

Without prior arrangements, missed exams result in a grade of zero. Homework is due at the start of class on the due date; late homework is not accepted.

It is assumed that: you have the prerequisites for this course, and their prerequisites, etc., recursively.

The instructor reserves the right to fail for the course any student failing the final comprehensive examination.

The content of this syllabus is subject to change at the discretion of the instructor.

Assignments in this course require individual attention and effort to be of any benefit. All work is expected to be that of each student alone, without consultation with others, without reference to borrowed solutions and not the product of team efforts or collaboration with other authors. Plagiarism is the incorporation of someone else's words or ideas without proper attribution, whether taken from another student, an author, the instructor's published solutions or the Internet. Plagiarism constitutes theft of intellectual property, and those who engage in it will receive the failing grade of ``E''. These and other provisions are governed by the University's Code of Academic Integrity which applies to all those in this course.

It is a violation of the Code to use another person's solutions as your own, whether those solutions are taken from a student in this course, or taken from solutions obtained from an earlier offering of this course, or taken from the files of a student who took this course earlier.

All written work submitted for credit must be prepared using a program capable of producing typeset output with the appropriate type faces, symbols and notation used in the theory of computation (e.g., TeX, LaTeX, troff, Microsoft Word + Equation). Do not submit handwritten work. Diagrams should be prepared with drawing tools like xfig, picasso, PowerPoint, etc.

Start each solution on a new page, repeat the problem statement, and number each page. Write on one side of the paper only. Submit answers in the labeled manila envelope (provided in class) on or before the due date. Do not seal the envelope (in order that it may be reused.) Write concise and limpid solutions, as failure to communicate clearly will cost points whether or not the conclusion is correct. It is highly advisable to revise your work before submission, and to consider whether your argument will be understandable to the reader. It is never a waste of effort to explain the strategy of what you intend to do in a proof or construction, before beginning the work in detail.

Students with disabilities, who may require academic adjustments or reasonable accommodations in order to participate fully in course activities or to meet course requirements, must first register with the Disability Resource Center, 1540 E 2nd St, 621-3268, email drc@w3.arizona.edu, URL http://drc.arizona.edu. DRC staff will qualify students for services, and provide a letter to be submitted directly to the instructor during the first week of classes.

1. Programming Linguistics
   1. Introduction: Syntax, semantics and pragmatics. Criteria for language design. Imperative vs. Applicative languages. Operational, denotational and axiomatic semantics. History and evolution.
   2. Variables, Expressions and Statements: Binding time spectrum. Variables and expressions. Assignment. l-values and r-values. Environments and stores. Storage allocation. Constants and initialization. Expressions. Statement-level control structures.
   3. Types: Primitive types. Pointers. Structured types. Coercion. Notions of type equivalence. Polymorphism: overloading, inheritance, type parameterization.
   4. Procedure Mechanisms: Declarations and activations. Parameter passing. Exceptions. Coroutines. Concurrency. Generators.
   5. Referencing Environments: Static, semidynamic and dynamic activation records. Local vs. global references. Static chain and display. Central referencing environment. Funargs. Deep vs. shallow binding. Parameter passing. Aliasing. Block structure.
   6. Data Encapsulation: Abstract datatypes. Information hiding and abstraction. Visibility. Procedures. Modules. Classes. Packages. Objects and Object-Oriented Programming: inheritance, subtypes and extensions. Simula 67 classes. Smalltalk-80. C++.
2. Programming Language Semantics
   1. Symbol and Meaning: Metalanguage and object language. Semantic maps. Mathematical background: functions, operators, relations, partial orders.
   2. Syntax: Abstract vs concrete syntax. Syntactic domains. Static and dynamic semantics. Abstract syntax trees.
   3. Semantic Description: denotational semantics; operational semantics; axiomatic semantics. Examples with a simple imperative language.
   4. Lambda Calculus: Abstraction and application. Free/bound variables. Reduction. Normal forms and divergence. Church-Rosser theorem. Typed lambda calculus. Semantics of a simple applicative language.
   5. Recursive Definition: The problem of recursive definition. Semantic domains. Continuous functions. Strictness. Fixpoint theory. Successive approximation. Domain-theoretic semantics of an applicative language. Operational semantics: minimal fixpoints and computation rules.
   6. Denotational Semantics of Imperative Languages: Environment/state semantics. Expressions. Commands. Loops. Environments and blocks; refs and dynamic storage. Product types and arrays. l-values and r-values. Jumps and environment/continuation/state semantics. Semantics of parameter passing modes.

• Lecture01: Introduction
• Lecture02: Criteria for Language Design

• Reading:
  • Due Mon 2 Feb:
    • Watt, Chapter 1: Introduction -- all, and
      Chapter 2: Syntax -- all (Watt notes at Student Union Bookstore)
    • Scott, Chapter 1: Introduction -- all, and
      Chapter 2: Syntax -- all. This material is review of subjects covered in the prerequisite for this course and should be familiar.
• Homework:

• Examinations: Information about exams is posted here in advance of the test.