Programming Language (CS 550)

 Announcments  Lectures  Programs  Course Resources   Assignments and Solutions  Grading Policy
Course Description
Covers basic concepts of the design and implementation of programming languages, including data representation and types, functions, sequence control, environments, block structure, subroutines and coroutines, storage management. Emphasizes language features and implementation, not mastery of any particular languages.
This is a core course required by all graduate Computer Science students and is an elective for graduate Software Engineering students. The course is available to other students with sufficient programming experience (see prerequisites) who have an interest in programming languages (e.g. Information Systems, Computer Engineering, etc.).
Course Themes
  1. Evaluation and implementation of of programming languages
  2. Tools for describing and analyzing languages, including syntax, semantics, and pragmatics
  3. Tools to design new languages
  4. Programming Paradigms (imperative, functional, logic, object-oriented
  5. Implementation of programming languages
Course Objectives
  1. Be able to compare and evaluate different programming languages and implement different programming constructs and features (e.g. variables, loops, procedures, dynamic memory).
  2. Be able to formally specify the syntax and semantics of programming languages.
  3. Be able to write a parser and a scanner.
  4. Be able to write a translator to convert from one language to another.
  5. Be able to describe the semantics of and implement an interpreter and compiler for a simple programming language.
  6. Be comfortable with the major programming paradigms and be able to use at least one language from each paradigm.
Course Benefits
  1. Easier to express algorithmic ideas
  2. Better able to formally express concepts
  3. Improved ability to select appropriate languages
  4. Easier to learn new languages
  5. Understand the significance and impact of language choices and constructs
  6. Able to design new languages (little languages, interface specifications, protocols)
Assumes familiarity with the basics of logic (predicate calculus), recursion and induction, automata, and grammars. All students should be proficient with at least one object-oriented programming language (e.g. java, C++), and it would be helpful to have seen at least two different programming languages.
Jeremy Johnson
Office: University Crossings 100C
e-mail: jjohnson AT cs DOT drexel DOT edu
office hours: R 4-6 and online W 7-8, additional hours by appointment.
Xu Xu
Office: University Crossings 147
e-mail: xx27 AT drexel DOT edu
office hours: M 4-6, additional hours by appointment.
Meeting Time
Thursday 6-9:00 in UC 153 and online. The online and in class versions of the course will be identical (in class lectures will be recorded and posted on webct and use of online discussions will be required by everyone).
Course Mailing List
cs550 AT cs DOT drexel DOT edu

Please use this list for questions and discussions related to the course. If you know the answer to someone's question, please feel free to jump in, as long as well it is not an answer to a homework problem. I will moderate the list so that frivolous mail and spam is not forwarded.


  1. Week 1: Functional Programming and Scheme (ch. 11 and SICP)
  2. Week 2: Lambda Calculus, Environments, and a Scheme Interpreter (ch. 11 and SICP)
  3. Week 3: Logic Programming and Query Languages (ch. 12 and SICP)
  4. Week 4: Type checking and ML (ch. 6 and 11)
  5. Week 5: Template Meta-programming (ch. 6 and ???)
  6. Week 6: Parsing and Grammars (ch. 4)
  7. Week 7: Operational Semantics (ch. 5 and 13)
  8. Week 8: Mini Language Compiler (ch. 5 and 13)
  9. Week 9: Denotational Semantics (ch. 13 and SICP)
  10. Week 10: Axiomatic Semantics (ch. 13)


  1. Homework and participation (50%)
  2. Midterm (25%)
  3. Final Exam (25%)
Students will be assigned to groups (4 students each - members may come from either the in class or online sections). Each group will be responsible for weekly homework (8 total), and each member will take the lead on two of the assignments. Peer grading will be used for group participation and discussion groups will be set up in webct for each group and all members are expected to participate in the discussions and contribute to every assignment. Doing all of the assignments will be essential for the exams.


Reference Books
  1. John R. Levine, Tony Mason, Doug Brown, Lex & Yacc, 2nd/updated edition (October 1992), O'Reilly & Associates. An online copy of this book is available through Drexel's library (safari).
  2. Alfred V. Aho and Jeffrey D. Ullman, Foundations of Computer Science - C Edition, W. H. Freeman and Company, 1995.
  3. list reference books here.
Web Pages
  1. Ken Louden's Web resources for the text Programming Languages.
  2. [SICP] Abelson and Sussman, Structure and Interepretation of Computer Programs.
  3. Graphviz - Graph Visualization Software.
  4. CUP Reference Manula - Parser generator for Java.
  5. PLY - Python Lex-Yacc.
  6. scheme
  7. MIT/GNU Scheme
  8. Lambda Calculus Tutorial from Chris Barker at NYU.

Look Here for Important Announcements

Announcements (Last updated Wed. April 4)


This list is tentative and may be modified at the instructor's discretion.
  1. Lecture 1: Functional Programming and Scheme
  2. (ch. 11)
  3. Lecture 2: Operational Semantics of scheme using Substitution
  4. (ch. 11 and ch. 3 of SICP)
  5. Lecture 3: A Meta-Circular Scheme Interpreter
  6. (ch. 4, sec. 1-3, of SICP)
  7. Lecture 4: Logic Programming and a Simple Query Language
  8. (ch. 12 of the text and ch. 4, sec. 4, of SICP)
  9. Lecture 5: Dynamic Memory Allocation and Garbage Collection
  10. (ch. 5 sec. 7 and ch. 8 sec. 5 of the text)
  11. Lecture 6: Grammars and Parsing
  12. (ch. 4 of the text)
  13. Lecture 7: Mini Language Interpreter
  14. (ch. 5, 7, and 8 of the text)
  15. Lecture 8: Mini Language Compiler
  16. (ch. 5, 7, and 8 of the text)

Programs and Worksheets



Created: 3/30/07 by jjohnson AT cs DOT drexel DOT edu