CSCI.2300 Introduction to Algorithms and CSCI.2600 Principles of Software.
Programming Language Essentials. Functional, Concurrent, and Logic Programming Paradigms.
When the students have successfully completed this course, they will be able to:
|09/01||Introduction to programming languages: history, essentials, syntax, semantics, paradigms.||ppt pdf||PDCS Chapter 2|
|09/05||Lambda calculus: alpha-renaming, beta-reduction, applicative and normal evaluation orders, Church-Rosser theorem, combinators, booleans||ppt pdf functions.oz functions.hs combinators.oz combinators.hs eta.oz eta.hs||PDCS Chapter 2|
|09/08|| Lambda calculus: higher order programming, eta-conversion,
recursion combinator, numbers, Church numerals
||ppt pdf rec.oz lambda-numbers.oz lambda-numbers.hs lambda-booleans.oz lambda-booleans.hs hop.oz hop.hs seq.oz||PDCS Chapter 2|
|09/12|| Functional programming: lists, records, pattern matching,
recursion (Haskell, Oz)
Programming Assignment 1 Due 09/25
PA1 description (pdf)
ppt pdf pascal.oz pascal.hs lists.oz lists.hs comb.oz comb.hs nth.hs nth.oz
|CTM Sections 1.1-1.7, 3.2, 3.4.1-3.4.2, 4.7.2|
|09/15||Higher order programming: closures, procedural abstraction, genericity, instantiation, embedding.||ppt pdf sqrt.oz sqrt.hs||CTM Chapters 3.2 and 3.6.1|
|09/19||Control abstractions: map, reduce, iterate, fold, filter||ppt pdf explicit-lazy.oz mapreduce.oz iscombinator.oz iscombinator.hs mapreduce.hs||CTM Sections 1.9, 3.6, 4.7|
|09/22||Lazy evaluation, infinite data structures, set comprehensions||pdf ppt lazy-eval.hs lazy-eval.oz||CTM Chapters 1.8 and 4.5|
|09/26||Type checking and type inference, abstract data types, monads|
|09/29||Review for Exam 1|
|10/06||Actors: a model of concurrent computation|
|10/13||Actor programming languages (SALSA, Erlang)|
|10/17||Concurrency control abstractions
Programming Assignment 2 Due 10/30
|10/20||Distributed systems abstractions
||Mobility (SALSA) and fault-tolerance (Erlang) abstractions; garbage collection, visualization (SALSA), hot code loading (Erlang)|
|10/27||Object-oriented programming: inheritance, polymorphism (Oz, Java)|
||Declarative concurrency: dataflow variables, suspendable statements (Oz)|
|11/03||Review for Exam 2|
|11/10||Predicate calculus, first-order logic, Horn clauses, Clocksin-Mellish procedure.|
||Terms, resolution, unification, search, backtracking (Prolog); Relational computation model (Oz).|
||Prolog imperative control flow: cut(!), call, fail, not, repeat, findall. Closed-world assumption, generate-and-test. Lists, append relation (Prolog, Oz)
Programming Assignment 3 Due 11/30
||Constraint satisfaction problems: propagate-and-search; natural language parsing: definite clause grammars|
|11/28||Prolog I/O, equalities, types, operators; Databases: assert, retract
|12/01||Accumulators, difference lists
|12/05||Constraint programming: computation spaces
|12/08||Review for Exam 3|
The course consists of three main parts, covering respectively functional, concurrent, and logic programming. Evaluation for each part includes a programming assignment and a partial exam.
For functional programming, we will use Haskell and Oz. For concurrent programming, we will use SALSA and Erlang. For logic programming, we will use Prolog and Oz. You must understand both languages to be prepared for exams. However, you can choose any of the two supported programming languages per paradigm for programming assignments, or even your own (but do not expect help from the instructor or TAs if you choose your own). Programming assignments can be done either individually or in pairs. Do not show your code to any other group and do not look at any other group's code. Do not put your code in a public directory or otherwise make it public. You are encouraged to use the LMS Discussions page to post questions so that other students can also answer/see the answers. There will be three grace days for late submissions throughout the semester, to be used in any combination of PAs, e.g., PA1 may be one day late and PA3 may be two days late, as long as PA2 was submitted on time. Late assignments beyond the three day grace period will receive a grade of 0.
Students may use for reference during exams: physical textbooks, printed course slides, and one personal one-sided crib sheet. No electronics will be allowed. All exam answers must be the student's own. Exam grades may be curved.
We will use an adaptive weighting scheme for grades: The best two programming assignments will have a total grade weight of 40% (20% each), while the third one will have a weight of 10%. We will use the same adaptive weighting scheme for partial exams: the best two exam grades will be worth 40% of the total grade with the third one counting for 10% of the total grade. Final letter grades will then be assigned as follows: