CSCE 330: Programming Language Structures

TTH 2:00PM-3:15PM SWGN 2A27

Prerequisites: CSCE 212, CSCE 245, MATH 374

Instructor: Marco Valtorta
Office: Swaeringen 3A55, 777-4641
E-mail: mgv@cse.sc.edu
Office Hours: M 1400-1530 W 1000-1100 or by previous appointment.
Teaching Assistant: Ravi Katpelly
Office 3D22, katpelly@cse.sc.edu Office Hours: MTh 1300-1400, Phone 777-8944

Syllabus

Notes concerning the final exam

Grading Policy

Reference materials:

Ghezzi, Carlo and Mehdi Jazayeri. Programming Language Concepts. Wiley, 1998 (required text, referred to as [G]). Supplementary materials from the authors, including an errata list, are available. A local copy of the simplesem interpreter is available as a zip archive (simple.zip) at ftp://ftp.cse.sc.edu/pub/valtorta/. Simplesem has also been installed on the departmental Sun workstations (rivers and constellations): see /usr/local/etc/csce330. See below for an introduction to Simplesem and its use.

Ullman, Jeffrey D. Elements of ML Programming: ML97 Edition. Prentice-Hall, 1998 (required text, referred to as [U]). Supplementary materials from the author, including an errata list, are available.

• Categorize a language as imperative (procedural), functional (applicative) or declarative (logic).
• Understand and use syntax descriptions in EBNF. {homework, tests}
• Explain the procedural semantics of procedural languages and the denotational semantics of procedural languages.
• Write code in functional and logic languages (e.g., ML and Prolog).
• Introduce formal methods for the description of programming languages.
• Develop an understanding of the organization of programming languages and the run-time behavior of programs.
• Introduce languages which illustrate a wide variety of approaches to programming language design and implementation.
• Provide an opportunity to use a variety of different computer environments.

• Introduce a functional and a logic programming language;
• Provide a comparative overview of programming languages and their features;
• Describe (semi-)formally syntax and semantics of programming language constructs.
• Study the run-time behavior of block-oriented, statically-typed imperative languages.