CS3100 - Paradigms of Programming

Meetings  

• Theme 1 : Functional Programming Basics using OCaml - 18 meetings

  • Meeting 01 : Tue, Aug 03, 11:00 am-11:50 am

  Administrative announcements. Discussion about the course. Why Programming Languages?

  References
  Exercises
  Reading

  Administrative announcements. Discussion about the course. Why Programming Languages?
  

  References

  :

  None

  • Meeting 02 : Wed, Aug 04, 10:00 am-10:50 am

  A Single Instruction Language Program. Correctness. Role of Referential Transparency.

  References
  Exercises
  Reading

  A Single Instruction Language Program. Correctness. Role of Referential Transparency.
  

  References

  :

  None

  • Meeting 03 : Thu, Aug 05, 08:00 am-08:50 am

  Imperative and Declarative Programming. Functional and Logic Programming. Static and Dynamic Semantics

  References
  Exercises
  Reading

  Imperative and Declarative Programming. Functional and Logic Programming. Static and Dynamic Semantics
  

  References

  :

  None

  • Meeting 04 : Tue, Aug 10, 11:00 am-11:50 am

  OCaml Basics. Expressions. Syntax. Static and Dynamic Semantics.

  References
  Exercises
  Reading

  OCaml Basics. Expressions. Syntax. Static and Dynamic Semantics.
  

  References

  :

  None

  • Meeting 05 : Wed, Aug 11, 10:00 am-10:50 am

  Usage of Jupyter-notebooks.<br> If-then-else-expressions in OCaml. Static and Dynamic Semantics in the inference form.

  References
  Exercises
  Reading

  Usage of Jupyter-notebooks.
  If-then-else-expressions in OCaml. Static and Dynamic Semantics in the inference form.
  

  References

  :

  None

  • Meeting 06 : Thu, Aug 12, 08:00 am-08:50 am

  let-expressions and let definitions. Shadowing.

  References
  Exercises
  Reading

  let-expressions and let definitions. Shadowing.
  

  References

  :

  None

  • Meeting 07 : Fri, Aug 13, 04:50 pm-05:40 pm

  Anonymous Functions, Function applications, Function definitions.

  References
  Exercises
  Reading

  Anonymous Functions, Function applications, Function definitions.
  

  References

  :

  None

  • Meeting 08 : Tue, Aug 17, 11:00 am-11:50 am

  More on Functions and Recursion in OCaml.

  References
  Exercises
  Reading

  More on Functions and Recursion in OCaml.
  

  References

  :

  None

  • Meeting 09 : Wed, Aug 18, 10:00 am-10:50 am

  Tail recursion. Labelled and Optional Arguments. Operators, Pattern-Matching in OCaml.

  References
  Exercises
  Reading

  Tail recursion. Labelled and Optional Arguments. Operators, Pattern-Matching in OCaml.
  

  References

  :

  None

  • Meeting 10 : Thu, Aug 19, 08:00 am-08:50 am

  Data Types Lists, Tuples, Semantics and usage in functions, Records in OCaml.

  References
  Exercises
  Reading

  Data Types Lists, Tuples, Semantics and usage in functions, Records in OCaml.
  

  References

  :

  None

  • Meeting 11 : Tue, Aug 24, 11:00 am-11:50 am

  Records and Variants.

  References
  Exercises
  Reading

  Records and Variants.
  

  References

  :

  None

  • Meeting 12 : Wed, Aug 25, 10:00 am-10:50 am

  Recursive Variants and Parameterized Variants

  References
  Exercises
  Reading

  Recursive Variants and Parameterized Variants
  

  References

  :

  None

  • Meeting 13 : Thu, Aug 26, 08:00 am-08:50 am

  Lists as Variants. Revisiting Pattern matching and applications to lists.

  References
  Exercises
  Reading

  Lists as Variants. Revisiting Pattern matching and applications to lists.
  

  References

  :

  None

  • Meeting 14 : Tue, Aug 31, 11:00 am-11:50 am

  Options and More on Pattern Matching

  References
  Exercises
  Reading

  Options and More on Pattern Matching
  

  References

  :

  None

  • Meeting 15 : Wed, Sep 01, 10:00 am-10:50 am

  Exceptions in OCaml. Raising, catching and handling exceptions.

  References
  Exercises
  Reading

  Exceptions in OCaml. Raising, catching and handling exceptions.
  

  References

  :

  None

  • Meeting 16 : Tue, Sep 07, 11:00 am-11:50 am

  Higher-order functions. The map function. Implementations.

  References
  Exercises
  Reading

  Higher-order functions. The map function. Implementations.
  

  References

  :

  None

  • Meeting 17 : Wed, Sep 08, 10:00 am-10:50 am

  Fold and filter on lists.

  References
  Exercises
  Reading

  Fold and filter on lists.
  

  References

  :

  None

  • Meeting 18 : Thu, Sep 09, 08:00 am-08:50 am

  Folding on trees, folding on variants. Generalized Fold.

  References
  Exercises
  Reading

  Folding on trees, folding on variants. Generalized Fold.
  

  References

  :

  None

• Theme 2 : Lambda Calculus - 14 meetings

  • Meeting 19 : Tue, Sep 14, 11:00 am-11:50 am

  Introduction to lambda calculus. History and Syntax.

  References
  Exercises
  Reading

  Introduction to lambda calculus. History and Syntax.
  

  References

  :

  None

  • Meeting 20 : Wed, Sep 15, 10:00 am-10:50 am

  Free variables and Alpha Equivalence

  References
  Exercises
  Reading

  Free variables and Alpha Equivalence
  

  References

  :

  None

  • Meeting 21 : Thu, Sep 16, 08:00 am-08:50 am

  More on alpha equivalence. Substitution.

  References
  Exercises
  Reading

  More on alpha equivalence. Substitution.
  

  References

  :

  None

  • Meeting 22 : Fri, Sep 17, 02:00 pm-02:50 pm

  Lambda calculus semantics, Beta reduction.

  References
  Exercises
  Reading

  Lambda calculus semantics, Beta reduction.
  

  References

  :

  None

  • Meeting 23 : Tue, Sep 21, 11:00 am-11:50 am

  Non-termination, Various reduction strategies.

  References
  Exercises
  Reading

  Non-termination, Various reduction strategies.
  

  References

  :

  None

  • Meeting 24 : Wed, Sep 22, 10:00 am-10:50 am

  Normal reduction, Call-by-Name, Call-by-need, Lazy-Evaluation, Call-by-Value, Strict-Evaluation.

  References
  Exercises
  Reading

  Normal reduction, Call-by-Name, Call-by-need, Lazy-Evaluation, Call-by-Value, Strict-Evaluation.
  

  References

  :

  None

  • Meeting 25 : Thu, Sep 23, 08:00 am-08:50 am

  Strong and Weak normalization. Eta reduction.

  References
  Exercises
  Reading

  Strong and Weak normalization. Eta reduction.
  

  References

  :

  None

  • Meeting 26 : Tue, Sep 28, 11:00 am-11:50 am

  Lambda calculus encodings. Encoding Boolean values.

  References
  Exercises
  Reading

  Lambda calculus encodings. Encoding Boolean values.
  

  References

  :

  None

  • Meeting 27 : Wed, Sep 29, 10:00 am-10:50 am

  Encoding pairs in lambda calculus.

  References
  Exercises
  Reading

  Encoding pairs in lambda calculus.
  

  References

  :

  None

  • Meeting 28 : Thu, Sep 30, 08:00 am-08:50 am

  Encoding natural numbers, Successor, Zerotest, Plus, Multiply, Predecessor.

  References
  Exercises
  Reading

  Encoding natural numbers, Successor, Zerotest, Plus, Multiply, Predecessor.
  

  References

  :

  None

  • Meeting 29 : Fri, Oct 01, 02:00 pm-02:50 pm

  Fixpoints, Y-combinator, Encoding recursive functions.

  References
  Exercises
  Reading

  Fixpoints, Y-combinator, Encoding recursive functions.
  

  References

  :

  None

  • Meeting 30 : Tue, Oct 05, 11:00 am-11:50 am

  Encoding lists, head, tail, is_empty, recursive implementations.

  References
  Exercises
  Reading

  Encoding lists, head, tail, is_empty, recursive implementations.
  

  References

  :

  None

  • Meeting 31 : Wed, Oct 06, 10:00 am-10:50 am

  Simply-typed Lambda calculus (STLC). Simple types. Type judgments. Examples, Typability.

  References
  Exercises
  Reading

  Simply-typed Lambda calculus (STLC). Simple types. Type judgments. Examples, Typability.
  

  References

  :

  None

  • Meeting 32 : Thu, Oct 07, 08:00 am-08:50 am

  Reduction rules for Simply-Typed-Lambda-Calculus. Connection to typability. Howard-Curry-Correspondence.

  References
  Exercises
  Reading

  Reduction rules for Simply-Typed-Lambda-Calculus. Connection to typability. Howard-Curry-Correspondence.
  

  References

  :

  None

• Theme 3 : More on OCaml - Structure, Signature and Functors - 4 meetings

  • Meeting 33 : Tue, Oct 12, 11:00 am-11:50 am

  Side Effects, Reference Cells, Aliases, Structural vs Physical Equality, Value-Restrictions.

  References
  Exercises
  Reading

  Side Effects, Reference Cells, Aliases, Structural vs Physical Equality, Value-Restrictions.
  

  References

  :

  None

  • Meeting 34 : Wed, Oct 13, 10:00 am-10:50 am

  More on Value Restrictions. Mutable records. Doubly Linked Lists Examples, Arrays.

  References
  Exercises
  Reading

  More on Value Restrictions. Mutable records. Doubly Linked Lists Examples, Arrays.
  

  References

  :

  None

  • Meeting 35 : Thu, Oct 14, 08:00 am-08:50 am

  Abstraction in OCaml - Structures and Signatures

  References
  Exercises
  Reading

  Abstraction in OCaml - Structures and Signatures
  

  References

  :

  None

  • Meeting 36 : Thu, Oct 14, 04:00 pm-05:00 pm

  Functors, Sharing constraints. Example application - Serializable lists.

  References
  Exercises
  Reading

  Functors, Sharing constraints. Example application - Serializable lists.
  

  References

  :

  None

• Theme 4 : Logic Programming Basics using Prolog - 13 meetings

  • Meeting 37 : Thu, Oct 21, 08:00 am-08:50 am

  Staring at a Prolog program for finding the length of a list. Comparison with a Java and OCaml code for the same. The basic structure, facts, rules and queries.

  References
  Exercises
  Reading

  Staring at a Prolog program for finding the length of a list. Comparison with a Java and OCaml code for the same. The basic structure, facts, rules and queries.
  

  References

  :

  None

  • Meeting 38 : Fri, Oct 22, 02:00 pm-02:50 pm

  Review of Propositional and Predicate Logic. Intepretations and Models. Validity and Satisifiability checking problems.

  References
  Exercises
  Reading

  Review of Propositional and Predicate Logic. Intepretations and Models. Validity and Satisifiability checking problems.
  

  References

  :

  None

  • Meeting 39 : Tue, Oct 26, 11:00 am-11:50 am

  Prolog Semantics. Herbrand models and least Herbrand model.

  References
  Exercises
  Reading

  Prolog Semantics. Herbrand models and least Herbrand model.
  

  References

  :

  None

  • Meeting 40 : Wed, Oct 27, 10:00 am-10:50 am

  SLD Resolution Algorithm. SWIPL, tracing and demonstrations.

  References
  Exercises
  Reading

  SLD Resolution Algorithm. SWIPL, tracing and demonstrations.
  

  References

  :

  None

  • Meeting 41 : Thu, Oct 28, 08:00 am-08:50 am

  Prolog in Action - the Zebra Puzzle. Introduction to lists in Prolog.

  References
  Exercises
  Reading

  Prolog in Action - the Zebra Puzzle. Introduction to lists in Prolog.
  

  References

  :

  None

  • Meeting 42 : Fri, Oct 29, 04:50 pm-05:40 pm

  Arithmetic in Prolog. Representing Recursion. Last call optimization.

  References
  Exercises
  Reading

  Arithmetic in Prolog. Representing Recursion. Last call optimization.
  

  References

  :

  None

  • Meeting 43 : Tue, Nov 02, 11:00 am-11:50 am

  Branch points, non-termination.

  References
  Exercises
  Reading

  Branch points, non-termination.
  

  References

  :

  None

  • Meeting 44 : Wed, Nov 03, 10:00 am-10:50 am

  Importance of Rule Order and Goal Order. Towards Abstract Interpreter for Prolog.

  References
  Exercises
  Reading

  Importance of Rule Order and Goal Order. Towards Abstract Interpreter for Prolog.
  

  References

  :

  None

  • Meeting 45 : Fri, Nov 05, 02:00 pm-02:50 pm

  Abstract Interpreter for Prolog.

  References
  Exercises
  Reading

  Abstract Interpreter for Prolog.
  

  References

  :

  None

  • Meeting 46 : Tue, Nov 09, 11:00 am-11:50 am

  More Prolog Programming - Generate and test technique. Sorting.

  References
  Exercises
  Reading

  More Prolog Programming - Generate and test technique. Sorting.
  

  References

  :

  None

  • Meeting 47 : Wed, Nov 10, 10:00 am-10:50 am

  Pruning search trees using cuts. Negations and implementing negation using cuts.

  References
  Exercises
  Reading

  Pruning search trees using cuts. Negations and implementing negation using cuts.
  

  References

  :

  None

  • Meeting 48 : Thu, Nov 11, 08:00 am-08:50 am

  Implementing Type Inference for Simply Typed Lambda Calculus using Prolog.

  References
  Exercises
  Reading

  Implementing Type Inference for Simply Typed Lambda Calculus using Prolog.
  

  References

  :

  None

  • Meeting 49 : Fri, Nov 12, 04:50 pm-05:40 pm

  Program Synthesiser for Simply Typed Lambda Calculus using Prolog.

  References
  Exercises
  Reading

  Program Synthesiser for Simply Typed Lambda Calculus using Prolog.
  

  References

  :

  None