Course Syllabus
The table below gives the planned syllabus for the course.
This syllabus is subject to change, as experience dictates.
When it becomes necessary to
revise the schedule, this page will be updated to reflect
the changes.
Material describing the course and its
objectives and grading
policies is available elsewhere.
Readings should be done before the "lecture" meeting on the
given date, as the in-class quiz will be related to the
readings. Optional readings are optional, and can be used for
background or enrichment. References in the readings and
optional readings are from the book Concepts, Techniques,
and Models of Computer Programming
[vanRoy-Haridi04], except as noted.
Other references are given in the
bibliography below.
The rightmost column gives a mapping of topics to knowledge units from
the
Final Report of the Joint ACM/IEEE-CS Task Force on Computing Curricula 2001 for Computer Science.
Except for the initial meeting, all other course meetings are
concerned with all of the course's
essential learning outcomes.
| Dates |
Topics |
Readings (for quiz) |
Optional Readings |
Homework Due |
CC 2001 |
| Jan. 7 |
Introduction |
Handouts,
Grading Policy |
Preface |
|
PL1 |
| Jan. 9 |
Introduction to Programming Concepts |
Chapter 1, Sections 1.1-1.3 |
Appendix,
[MozartWeb]
[Watt90]
|
|
PL1-2, PL4, PL9 |
| Jan. 11 |
Introduction to Programming Concepts |
Sections 1.3-1.6 |
Appendix,
[MozartWeb]
[Watt90]
|
|
PL1-2, PL4, PL9 |
| Jan. 14 |
Introduction to Programming Concepts |
Sections 1.4, 1.8 |
Appendix,
[MozartWeb]
[Watt90]
|
HW 1 |
PL1-2, PL4, PL9 |
| Jan. 16 |
Introduction to Programming Concepts |
Sections 1.9-1.17 |
Appendix,
[MozartWeb]
[Watt90]
|
|
PL1-2, PL4, PL9 |
| Jan. 16 |
Declarative Computation Model
|
Chapter 2, Section 2.1 |
[Hudak89] |
|
PL1-3, PL10 |
| Jan. 18 |
Declarative Computation Model
|
Section 2.2 |
[Hudak89] |
|
PL1-3, PL10 |
| Jan. 21 |
Martin Luther King's Birthday, no class
|
|
|
|
|
| Jan. 23 |
Declarative Computation Model
|
Section 2.3 |
[Hudak89] |
|
PL1-3, PL10 |
| Jan. 25 |
Declarative Computation Model
|
Section 2.4 |
[Hudak89] |
|
PL2-3, PL10 |
| Jan. 28 |
Declarative Computation Model
|
Section 2.4 |
[Hudak89] |
|
PL2-3, PL10 |
| Jan. 30 |
Declarative Computation Model
|
Section 2.4-2.5 |
[Hudak89] |
HW 2, p. 1-2,4 |
PL2-3, PL10 |
| Feb. 1 |
Declarative Computation Model
|
Section 2.5-2.6 |
[Hudak89] |
|
PL2-3, PL10 |
| Feb. 4 |
Declarative Computation Model
|
Section 2.7 |
[Hudak89] |
HW 2, p. 5-6 |
PL2-3, PL10 |
| Feb. 6 |
Declarative Programming Techniques |
Chapter 3 intro, 3.1-3.2 |
[Hudak00] |
|
PL2-3, PL10 |
| Feb. 8 |
Declarative Programming Techniques |
Section 3.2 |
[Hudak00] |
|
PF4, PL4-5, PL7, PL9-11 |
| Feb. 11 |
Declarative Programming Techniques |
Section 3.2-3.4.1 |
[Hudak00]
[Leavens07] |
HW 2, p. 3, 7-11 |
PF4, PL4-5, PL7, PL9-11 |
| Feb. 13 |
Declarative Programming Techniques |
Section 3.4.1-3.4.2 |
[Hudak00] |
|
PF4, PL4-5, PL7, PL9-11 |
| Feb. 15 |
Declarative Programming Techniques |
Section 3.4.2-3.4.8 |
[Hudak00] |
|
PF4, PL4-5, PL7, PL9-11 |
| Feb. 18 |
Declarative Programming Techniques |
Section 3.5-3.6 |
[Hudak00] |
HW 3, p. 1-6 |
PF4, PL4-5, PL7, PL9-11 |
| Feb. 20 |
Declarative Programming Techniques |
Section 3.6 |
[Hudak00] |
|
PF4, PL4-5, PL7, PL9-11 |
| Feb. 22 |
Exam 1 |
Chapters 1-2 |
Preface, Appendix,
[MozartWeb],
[Hudak89],
[Watt90]
|
|
PF4, PL1-4, PL10 |
| Feb. 25 |
Declarative Programming Techniques |
Section 3.6-3.7 |
[Hudak00] |
HW 3, p. 7-11 |
OS3, PL5, PL7, PL10-11 |
| Feb. 27 |
Declarative Programming Techniques |
Section 3.7 |
[Hudak00] |
|
OS3, PL5, PL7, PL10-11 |
| Feb. 29 |
Declarative Programming Techniques |
Section 3.7 |
[Hudak00] |
|
OS3, PL5, PL7, PL10-11 |
| Mar. 3 |
Declarative Programming Techniques |
Section 3.7-3.8 |
[Hudak00] |
|
OS3, PL5, PL7, PL10-11 |
| Mar. 5 |
Declarative Programming Techniques |
Section 3.8-3.9 |
[Hudak00] |
HW 3, p. 12-24 |
OS3, PL5, PL7, PL10-11 |
| Mar. 5 |
Declarative Concurrency |
Chapter 4, Section 4.1 |
|
HW 3, p. 12-24 |
OS3, PL5, PL7, PL10-11 |
| Mar. 7 |
Exam 2 |
Sections 3.1-3.4 |
[Hudak00] |
|
PF4, PL4-5, PL7, PL9-11 |
| Mar. 10-14 |
Spring Break, no class |
|
|
|
|
| Mar. 17 |
Declarative Concurrency |
Sections 4.1 |
|
|
OS3, PL5, PL7, PL10-11 |
| Mar. 19 |
Declarative Concurrency |
Sections 4.1-4.2 |
|
|
OS3, PL5, PL7, PL10-11 |
| Mar. 21 |
Declarative Concurrency |
Sections 4.2-4.3 |
|
|
OS3, PL5, PL7, PL10-11 |
| Mar. 24 |
Declarative Concurrency |
Sections 4.3 |
|
HW 4, p. 3-4,8 |
OS3, PL5, PL7, PL10-11 |
| Mar. 26 |
Declarative Concurrency |
Sections 4.3-4.5 |
|
HW 4, p. 5,7 |
OS3, PL5, PL7, PL10-11 |
| Mar. 28 |
Declarative Concurrency |
Sections 4.5 |
|
|
OS3, PL5, PL7, PL10-11 |
| Mar. 31 |
Declarative Concurrency |
Sections 4.5 |
|
|
OS3, PL5, PL7, PL10-11 |
| Apr. 2 |
Message Passing
|
Sections 4.5, 4.8 |
|
HW 4, p. 9-17,19-20 |
OS3, PL5, PL7, PL10-11 |
| Apr. 4 |
Exam 3 |
Sections 3.5-3.9, 4.1-4.4 |
Sections 3.1-3.4, 4.5 |
|
OS3, PL5, PL7, PL10-11 |
| Apr. 7 |
Message Passing
|
Section 4.9.2, Chapter 5, Section 5.1 |
|
|
OS3, PL5, PL7, PL10-11 |
| Apr. 9 |
Message Passing
|
Sections 5.2 |
|
|
OS3, PL5, PL7, PL10-11 |
| Apr. 11 |
Message Passing
|
Sections 5.2-5.7 |
|
|
OS3, PL5, PL7, PL10-11 |
| Apr. 14 |
Message Passing
|
Sections 5.7 |
|
HW 5, p. 1-6, 8-9, 11-12 |
PL5, PL10-11, IS2-3 |
| Apr. 16 |
Relational Programming |
Chapter 9, Section 9.1 |
|
HW 5, p. 7, 10 |
PL5, PL10-11, IS2-3 |
| Apr. 18 |
Relational Programming |
Section 9.2 |
|
|
PL5, PL10-11, IS2-3 |
| Apr. 21 |
Course Summary and Evaluation |
|
Chapter 1 |
HW 6 |
|
| Fri., Apr 25, 1:00pm-3:00pm |
Final Exam |
Sections 4.5, 4.8, 4.9.2, 5.1-5.7, 9.1-9.3 |
Chapter 1 |
|
PL5, PL10-11, IS2-3 |
Return to top
- [Hennessy90]
-
Matthew Hennessy.
The Semantics of Programming Languages.
Wiley, New York, NY, 1990.
- [Hudak89]
-
Paul Hudak.
Conception, Evolution, and Application of Functional Programming Languages.
ACM Computing Surveys 21(3):359-411, Sept. 1989.
http://doi.acm.org/10.1145/72551.72554
- [Hudak00]
-
Paul Hudak.
The Haskell School of Expression: Learning Functional
Programming through Multimedia.
Cambridge University Press, New York, NY, 2000.
- [Leavens07]
-
Gary T. Leavens.
Following the Grammar,
University of Central Florida, School of EECS, CS-TR-07-10b, November 2007.
http://www.eecs.ucf.edu/~leavens/COP4020/docs/follow-grammar.pdf
- [MozartWeb]
-
Mozart/Oz Web site,
http://www.mozart-oz.org/, accessed January 2, 2008.
- [vanRoy-Haridi04]
-
Peter van Roy and Seif Haridi.
Concepts, Techniques, and Models of Computer Programming.
MIT Press, Cambridge, MA, 2004.
- [Watt90]
-
David Watt.
Programming language concepts and paradigms.
Prentice-Hall, New York, NY, 1990.
Return to top
Course Content and Policies
The course's content
and grading polices
are described on separate web pages. See the links on the top
left of this page.
Return to top
Last modified Monday, April 14, 2008.
This web page is for the Spring 2008 offering of COP 4020
at the University of Central Florida.
The details of this course are subject to
change as experience dictates. You will be informed of any changes.
Please direct any comments or questions to
Gary T. Leavens.
Some of the policies and web pages for this course are
quoted or adapted from other courses I have taught, in partciular,
Com S 342.
