CSI 2120

CSI 2120 Programming Paradigms
Winter 2011

Presentation of the major programming paradigms: object-oriented, imperative, logic, functional. Related programming languages, their essential properties and typical applications. Programming in imperative, logic and functional languages. Influence of programming paradigms on problem solving and program design strategies. An overview of other paradigms, such as constraint-based, rule-based and event-driven programming. Prerequisite: CSI2110 or CSI2210.

Professor
Required Textbook
- Programming in Prolog, William F. Clocksin and Christopher S. Mellish, Springer, 5th edition, 2003.
- The Scheme Programming Language, R. Kent Dybvig, MIT Press, 4th edition, 2009. (The third edition is available on the web.)
- The textbooks are available at Benjamin Books, 122 Osgoode Street.
Other References
- Note: you can access E-Books from off campus by logging on to your library account.
- Programming Languages: Principles and Paradigms, Maurizio Gabbrielli and Simone Martini, Springer, 2010. Available as an E-Book from the university library.
- Programming Paradigms for Dummies: What Every Programmer Should Know, Peter Van Roy, in New Computational Paradigms for Computer Music, G. Assayag and A. Gerzo (eds.), IRCAM/Delatour France, 2009.
- Programming Languages: Principles and Paradigms, Allen B. Tucker and Robert E. Noonan, McGraw Hill, 2nd edition, 2007.
- Python Tutorial, Release 2.7.1, Guido van Rossum and Fred L. Drake, Jr., editors, 2011. Available in html.
- Documentation for The Python Standard Library
- Learning Python, Mark Lutz, O'Reilly Media, Inc., 4th edition, 2009. Available as an E-Book from the university library.
- Pascal (programming language), Wikipedia

Course Outline

Topic Reading (See "Required Textbooks" and "Other References" above)

An introduction to programming paradigms Required: Chapter 13, Gabbrielli and Martini
Optional: "Programming Paradigms for Dummies" article

Prolog: Introduction Required: Programming in Prolog Chapter 1

Prolog: Syntax and Lists Required: Programming in Prolog
Chapter 2, Sections 2.1, 2.2, 2.3, 2.4
Chapter 3, Sections 3.2, 3.3

Prolog: Satisfying Goals and Backtracking Required: Programming in Prolog
Chapter 2, Section 2.6

Prolog: Arithmetic, More on Lists Required: Programming in Prolog
Chapter 2, Section 2.5

Prolog: More on Lists, Structures, and Recursion Required: Programming in Prolog
Chapter 3, Sections 3.4, 3.5, 3.6

Prolog: Input/Output Required: Programming in Prolog
Chapter 5, Section 5.1

Prolog: Trees and Databases

Prolog: The cut operator Required: Programming in Prolog
Chapter 4, Sections 4.1, 4.2, 4.4

Prolog: More on Built-Ins Required: Programming in Prolog
Chapter 6, Sections 6.1, 6.2, 6.3, 6.4, 6.5

Prolog: Grammars and Parsing Required: Programming in Prolog
Chapter 9, Sections 9.1, 9.2, 9.3, 9.4, 9.5, 9.6

Paradigms Again Optional: Chapter 1, Tucker and Noonan

Scheme: Getting Started Required: The Scheme Programming Language
Chapter 1

Scheme: Simple Expressions, Evaluation, Arithmetic, Lists, Conditional Expressions, Simple Recursion Required: The Scheme Programming Language
Chapter 2, Sections 2.1 through 2.8

Scheme: I/O, Assignment, Vectors, Trees Required: The Scheme Programming Language
Chapter 2, Sections 2.9 (up to page 53)
Chapter 3, Sections 3.2
Chapter 4, Sections 4.1, 4.2, 4.4, 4.7
Chapter 6, Sections 6.9
Chapter 7, pages 284-285

Scheme: Functions as First-Class Data Values

Python Required: Python Tutorial
Chapters 1 and 3
Chapter 4, Sections 4.1, 4.2, 4.3, 4.6
Chapter 6, Sections 6.1, 6.2
Chapter 7, Section 7.2
Optional: Chapter 13, Section 13.5, Tucker and Noonan

Other Paradigms: Imperative Revisited (Pascal), Constraint Programming Optional: Gabbrielli and Martini, Chapter 12, Section 12.5.3

Other Paradigms: Concurrent Programming Optional: Tucker and Noonan, Chapter 17, Section 17.1

Topic	Reading (See "Required Textbooks" and "Other References" above)
An introduction to programming paradigms	Required: Chapter 13, Gabbrielli and Martini Optional: "Programming Paradigms for Dummies" article
Prolog: Introduction	Required: Programming in Prolog Chapter 1
Prolog: Syntax and Lists	Required: Programming in Prolog Chapter 2, Sections 2.1, 2.2, 2.3, 2.4 Chapter 3, Sections 3.2, 3.3
Prolog: Satisfying Goals and Backtracking	Required: Programming in Prolog Chapter 2, Section 2.6
Prolog: Arithmetic, More on Lists	Required: Programming in Prolog Chapter 2, Section 2.5
Prolog: More on Lists, Structures, and Recursion	Required: Programming in Prolog Chapter 3, Sections 3.4, 3.5, 3.6
Prolog: Input/Output	Required: Programming in Prolog Chapter 5, Section 5.1
Prolog: Trees and Databases
Prolog: The cut operator	Required: Programming in Prolog Chapter 4, Sections 4.1, 4.2, 4.4
Prolog: More on Built-Ins	Required: Programming in Prolog Chapter 6, Sections 6.1, 6.2, 6.3, 6.4, 6.5
Prolog: Grammars and Parsing	Required: Programming in Prolog Chapter 9, Sections 9.1, 9.2, 9.3, 9.4, 9.5, 9.6
Paradigms Again	Optional: Chapter 1, Tucker and Noonan
Scheme: Getting Started	Required: The Scheme Programming Language Chapter 1
Scheme: Simple Expressions, Evaluation, Arithmetic, Lists, Conditional Expressions, Simple Recursion	Required: The Scheme Programming Language Chapter 2, Sections 2.1 through 2.8
Scheme: I/O, Assignment, Vectors, Trees	Required: The Scheme Programming Language Chapter 2, Sections 2.9 (up to page 53) Chapter 3, Sections 3.2 Chapter 4, Sections 4.1, 4.2, 4.4, 4.7 Chapter 6, Sections 6.9 Chapter 7, pages 284-285
Scheme: Functions as First-Class Data Values
Python	Required: Python Tutorial Chapters 1 and 3 Chapter 4, Sections 4.1, 4.2, 4.3, 4.6 Chapter 6, Sections 6.1, 6.2 Chapter 7, Section 7.2 Optional: Chapter 13, Section 13.5, Tucker and Noonan
Other Paradigms: Imperative Revisited (Pascal), Constraint Programming	Optional: Gabbrielli and Martini, Chapter 12, Section 12.5.3
Other Paradigms: Concurrent Programming	Optional: Tucker and Noonan, Chapter 17, Section 17.1