COMS W4115 Programming Languages and Translators COMS W4115 Programming Languages and Translators Fall 2015 Lectures Class meets Mondays and Wednesdays 4:10 - 5:25 PM 207 Mathematics. Staff Name Email Office hours Location Prof. Edwards see my home page 462 CSB Richard Townsend F 2-4 TA Room (Mudd 1st floor) Prachi Shukla T 10-12 468 CSB David Arthur Th 2-4 TA Room (Mudd 1st floor) Lixin Yao M 10-11, W 11-12 TA Room (Mudd 1st floor) Aquila Khanam T 5:30-7:30 TA Room (Mudd 1st floor) Overview The goal of PLT is to teach you both about the structure of computer programming languages and the basics of implementing compilers for such languages. The course will focus mostly on traditional imperative and object-oriented languages, but will also cover functional and logic programming, concurrency issues, and some aspects of scripting languages. Homework and tests will cover language issues. You will design and implement a language of your own design in a semester-long group project.

1. 32 Flavors By Yfb
2. Example Of Pragmatics In English

While few of you will ever implement a full commercial compiler professionally, the concepts, techniques, and tools you will learn have broad application. Prerequisites COMS W3157 Advanced Programming: You will be dividing into teams to build a compiler, so you need to have some idea how to keep this under control. Quick test: you need to know about Makefiles and source code control systems. COMS W3261 Computability and Models of Computation: You will need an understanding of formal languages and grammar to build the parser and lexical analyzer. Quick test: you must know about regular expressions, context-free grammars, and NFAs. Schedule Date Session Lecture Notes Reading Due Wed Sep 9 1 Intro.

To Languages Ch 1, 2 Mon Sep 14 2 Language Processors Ch. 2 Wed Sep 16 3 Programming in OCaml Mon Sep 21 4 ' Wed Sep 23 5 Guest lecture Mon Sep 28 6 Ocaml contd. Wed Sep 30 7 ' Proposal Mon Oct 5 8 ' Wed Oct 7 9 Syntax and Parsing Ch. 3, 4 Mon Oct 12 10 ' Wed Oct 14 11 ' HW1 Mon Oct 19 12 ' Wed Oct 21 13 The MicroC Compiler App. A HW2 Mon Oct 26 14 Review for Midterm LRM Wed Oct 28 Midterm Exam Mon Nov 2 Election Day Holiday Wed Nov 4 15 MicroC Contd. Mon Nov 9 16 MicroC Contd. Wed Nov 11 17 Types and Static Semantics Sec.

6.5 Mon Nov 16 18 Runtime Environments Ch. 7 Hello World Wed Nov 18 19 ' Mon Nov 23 20 ' Wed Nov 25 21 Code Generation Mon Nov 30 22 The Lambda Calculus Wed Dec 2 23 ' Mon Dec 7 24 Logic Programming HW3 Wed Dec 9 25 Review for Final Mon Dec 14 Final Exam Tue Dec 22 Project Reports Due Required Text Alfred V. Aho, Monica Lam, Ravi Sethi, and Jeffrey D. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 2006. Second Edition.

The first edition was long the standard text on compilers; the second edition of the ``dragon book' has now been updated and continues to be one of the more readable books on the topic. Columbia's own Prof. Al Aho is one of the authors. Related Texts Michael L. Morgan Kaufmann, 2006. Second Edition. A broad-minded book about languages in general, but has less on practical details of compiler construction.

Cambridge University Press, 1998. The opposite of Scott: focuses on compiler construction, not language design issues. It uses the functional language ML, which is closely related to O'Caml, but just different enough to be annoying.

Cambridge University Press, 1996. Second edition.

A book about functional programming. It's written for the ML language, not O'Caml, but the two are closely related. Muchnick Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997. A very extensive book on many aspects of compiler design. Starts about halfway through Appel and goes much farther. Recommended for serious compiler hackers only.

Objective Caml Resources The Caml Language Homepage. Compiler downloads and documentation. The Objective Caml System. Documentation and User's Manual for the whole system, including documentation for ocamllex, ocamlyacc, ocamldep, ocamldebug, and all the standard libraries.

Jason Hickey, Introduction to Objective Caml. One of my favorite books on O'Caml. Emmanuel Chailloux, Pascal Manoury, and Bruno Pagano, Developing Applications with Objective Caml.

An online book translated from the French (O'Reilly). Objective CAML Tutorial O'Caml source for the four-function calculator. O'Caml source and test cases for the microc language. The Project The focus of 4115 is the design and implementation of a little language. You will divide into teams and design the goals, syntax, and semantics of your language, and implement a compiler for your language. Exception: CVN students will do the project individually. Final Report Outline This is a critical part of the project and will be a substantial fraction of the grade.

Include the following sections:. Introduction. Include your language white paper. Language Tutorial.

A short explanation telling a novice how to use your language. Language Manual. Include your language reference manual.

CSc 520 Principles of Programming Languages This document is at URL CSc 520 Principles of Programming Languages Spring 2006 Time and Place MW 12:00-1:15, Gould-Simpson 701 Descrip- tion This course will define, analyze and evaluate important concepts found in current programming languages. Its goals are to build an ability to evaluate and compare programming languages, both from the user's and implementor's view, and to develop precise mechanisms for specifying the semantics of programming languages. Specific topics include: data abstraction, datatypes, control structures, storage management and runtime support, operational and denotational semantic specification, applicative and object-oriented languages. Pre- requisite Instructor (520) 621-2207 Gould-Simpson 739 Office Hour: MW 1:15 - 2:30 These are walk-in office hours.

Outside of these hours, make an appointment in advance through Tessa Chalberg ( chalberg@cs.arizona.edu), Administrative Associate, Gould-Simpson 917A, 621-8448 For prices and availability, see the. Michael L. Scott, Programming Language Pragmatics, 2nd Edition, Morgan-Kaufmann, 2006. Excerpts from David A. Watt, Programming Language Syntax and Semantics, Prentice-Hall, 1997. I will announce when this packet is available from (621-5306), probably in late January. In addition to regular lectures, papers from the literature on programming languages will be assigned for reading.

Grades for this course will be influenced by interaction in the classroom, and by your preparation and familiarity with the reading material. Weight item 40% Homework (4-5 problem sets) 30% Midterm Exam 30% Final Comprehensive Exam date event Wed Jan 11 First class Mon Jan 16 Martin Luther King, Jr Holiday - no class Mon Jan 23 Last day to add Tue Feb 7 Last WebReg drop Sat Mar 11 - Sun Mar 19 Spring Recess Wed Mar 22 Midterm Wed May 3 Last class Fri May 5 Final Exam: 2:00 pm - 4:00 pm, G-S 701 All students need to run the apply program each semester. This is the case whether or not you have a pre-existing account. For Everybody: All students are required to fill out the web page entitled Computer Account Application Request Form at URL.

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 you can be assigned a correct Computer Science ID (CSID) number). NOTE: If you have not done this update by Census Day (Tue 7 Feb), your account will be closed. For a student with a currently active account in C SC: At the web page, under TYPE of APPLICATION, select UPDATE an OPEN account for new classes.

Read the 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. (During the first week of classes, the Department provides machines for this purpose in Room 919 Gould-Simpson Bldg.) At the web page, under TYPE of APPLICATION, select either NEW account on CS systems, or RE-activate an EXISTING closed CS account. Read the 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 919 while the account registration machines are set up there, and at the Reception Desk in Room 917 thereafter. For Everybody: You will need to know your CSID, since grades will be posted using this identifier. To find your CSID at any time, go to At the prompt, enter your University of Arizona Student ID (SID). (Hyphens are optional).

Record your CSID for future reference. 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 scores 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 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. 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. 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 or the incorporation of another author's words or ideas constitutes theft of intellectual property; it will result in a grade of zero. Copying work from another student, whether currently or formerly enrolled in this course, copying from a book or paper, or copying text from a web page all constitute plagiarism. These and other provisions are governed by the 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 from a student who took this course earlier.

It is assumed that: you have the prerequisites for this course, and their prerequisites, etc., recursively; that you are literate in a few modern computer languages; that you are both literate and a competent programmer in C; and that you are skilled in the use of the programming environment and Unix tools available in the Department's Graduate Instructional Laboratory. The instructor reserves the right to fail for the course any student failing the final comprehensive examination. Programming Linguistics. Introduction: Syntax, semantics and pragmatics. Criteria for language design. Imperative vs. Applicative languages.

Operational, denotational and axiomatic semantics. History and evolution. Variables, Expressions and Statements: Binding time spectrum.

Variables and expressions. L-values and r-values.

Environments and stores. Storage allocation. Constants and initialization.

Statement-level control structures. Types: Primitive types. Structured types. Notions of type equivalence.

Polymorphism: overloading, inheritance, type parameterization. Procedure Mechanisms: Declarations and activations. Parameter passing. Referencing Environments: Static, semidynamic and dynamic activation records. Global references. Static chain and display.

Central referencing environment. Shallow binding. Parameter passing.

Block structure. Data Encapsulation: Abstract datatypes. Information hiding and abstraction. Objects and Object-Oriented Programming: inheritance, subtypes and extensions.

Simula 67 classes. Programming Language Semantics. Symbol and Meaning: Metalanguage and object language.

Semantic maps. Mathematical background: functions, operators, relations, partial orders. Syntax: Abstract vs concrete syntax.

Syntactic domains. Static and dynamic semantics. Abstract syntax trees. Semantic Description: denotational semantics; operational semantics; axiomatic semantics. Examples with a simple imperative language.

Lambda Calculus: Abstraction and application. Free/bound variables. Normal forms and divergence. Church-Rosser theorem. Typed lambda calculus.

Semantics of a simple applicative language. Recursive Definition: The problem of recursive definition. Semantic domains. Continuous functions. Fixpoint theory.

Successive approximation. Domain-theoretic semantics of an applicative language.

Operational semantics: minimal fixpoints and computation rules. Denotational Semantics of Imperative Languages: Environment/state semantics. 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. Appropriate links to the library system are:.

The following books are on reserve at the Main Library Reserve Book Room. They may prove helpful as collateral readings.

Others may be added from time to time. of texts Reference Links. by Lloyd Allison. by Robert Harper.

by Robert Harper. ML modules are discussed in the tutorial by Claudio Russo found. is the CSc 520 newsgroup.

Regularly check this newsgroup either through the above link or via some other news reader ( pine, trn, etc.). The newsgroup is the place for homework updates, text errata, changes of due date, and advice from the instructor. Answers to student questions of public interest will be posted here. is the URL for this document, which is the official course syllabus.

It will be kept it up-to-date with information on assignments and exams. Reload it regularly to see any changes. Lecture01: Introduction. Lecture03: Theoretical Foundations.

Lecture04: Types and Polymorphism. Lecture05: Denotational Semantics. Lecture06: Parameters. Lecture07: Implementation of Block Structured Languaes. Lecture08: Control Semantics and Continuations.

Lecture09: Coroutines. Lecture10: Variables and Assignment.

Reading Assignments:. Due Wed 1 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. Due Mon 6 Feb:.

Watt, Chapter 3 (Semantics), Sections 3.1-3.2 Chapter 5 (Theory), Section 5.1. Scott, Chapter 3 (Names, Scopes and Bindings). Due Mon 13 Feb:. Watt: Section 3.3; Section 5.2.

Scott, 1st Ed: Chapter 11, Sections 11.1-11.2 Scott, 2nd Ed: Chapter 10, Sections 10.1-10.8. Read Lambda Calculus by Lloyd Allison; there is a link in the ``Reference Links' section above. Read Robert Harper, Introduction to Standard ML; there is a pdf version in the ``Reference Links' section above. Another good but optional reference is Programming in Standard ML; see the reference links above. Due Wed 22 Feb:.

Watt, Chapter 5 (Theory), Section 5.3. Scott (1st and 2nd eds.), Chapter 7 (Types), all. Due Wed 1 Mar:. Watt, Chapter 3, Sections 3.4 - 3.7. Scott (1st and 2nd eds.), Chapter 6 (Control Flow), all.

32 Flavors By Yfb

Due Mon 10 Apr:. Due Mon 1 May:. Homework and Exams:.

(due date postponed to Mon 6 Mar). Final Examination: Friday May 5, 2:00 pm - 4:00 pm, Gould-Simpson 701. Open book. Open notes. Grades are posted here and outside Room 739 Gould-Simpson. Grades are posted by your 'Computer Science ID' (CSID), which can be discovered by logging in as 'csid', password 'CSID' and responding to prompts. Exam and homework envelopes may be picked up in Room 901 Gould-Simpson.

Example Of Pragmatics In English

Last updated 12 Feb 2007.