Outline of CS 6371, Programming Languages
PROF. WILLIAM J. PERVIN
Concepts of Programming Languages,
by Robert Sebesta (4th Edition),
Note that this is basically an undergraduate textbook so
students should expect to find that additional material
will be covered in class.
- This is a required course for degree-seeking graduate
students in the traditional track of Computer Science.
- An understanding of the material in this course
is recommended for all students who intend use computers.
- Others who can benefit from this course include employees
of local high-technology companies who need an introduction
to computer science.
- Prerequisites: CS 5343 and CS 5349 or the equivalents.
(UNIX experience is highly recommended)
OVERALL GOALS OF CS 6371:
From the ACMTFFCS, we list
the fundamental topics as:
- BNF notation;
- some acquaintance with Ada;
- programming in a functional language;
- programming in PROLOG;
- modules and classes;
- exception handling;
- pointers; and
- type equivalence.
In addition, essential topics are:
- attribute grammars;
- type reconstruction;
- term rewriting;
- formal semantics;
- Hoare logic;
- lambda calculus;
- combinators; and
- Post systems.
We will try to mention Object Oriented Programming
and Java in class.
There will be
two equal tests and a comprehensive final.
Homework will also count in the grade.
The detailed assignments will be given in class.
The three languages to be used in this course are:
- Haskell : http://www.haskell.org
- Scheme : csclass:/usr/local/bin/xscheme
- PROLOG : /home/csshare/prolog/sun4/pl
For a very interesting web site for programming languages,
look at http://www.netti.fi/~simos/oasis/.
For a detailed syllabus, click
For downloads of code examples and compilers, click
Back to Dr. Pervin's Home Page