Outline of CS 4337, Programming Languages
PROGRAMMING LANGUAGES
SPRING 2000
PROF. WILLIAM J. PERVIN
TEXT:
Programming Languages, by Louden,
PWS, 1993.
TARGET AUDIENCES:
- This is a required course for degree-seeking
undergraduate
students in 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 2305 and CS 2315
or the equivalents.
(UNIX experience would be helpful)
OVERALL GOALS OF CS 4337:
From the ACMTFCCS, 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.
GRADING
There will be two examinations and a
comprehensive final examination.
Homework will count in the final grade.
HOMEWORK
The detailed assignments will be given in class.
The three languages to be used in this course are:
- ML : /home/csshare/ml-0.93/src/sml
- Scheme : /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
PC versions of these three languages (and many others) may
be found at this and other sites.
For a detailed syllabus, click
here
For handouts, click
here
For announcements, click
here
T.A.
Shriram Janardhan (shrijan@utdallas.edu)
Office Hours: TR 7:00pm-8:30pm in EC3.608
Homework
Scheme: Scheme Homework
Back to Dr. Pervin's Home Page
