COP 4555

General

• Syllabus
  • Section 01
  • Section 02
• Exam Information will be posted here prior to exams.
  • Check the Canvas calendar for exam dates.
  • Quiz 1 will be on January 30. It is based on Problem Set 1.
  • Quiz 2 will be on March 6. It is based on Problem Set 2.
  • Quiz 3 will be on April 15. It is based on Problem Set 3.
  • Exam 1 will be on May 16. It is based on Problem Set 1 and all the notes since the start of the term.
  • Exam 2 will be on March 20. It is based on Problem Set 2 and all the notes since Exam 1.
  • Exam 3 will be on April 22. It is based on Problem Set 3 and all the notes since Exam 2.
  • Exam 2
    • Date: Wednesday, 3/20.
    • Class Lecture Notes:
      • language03-syntax
      • fsharp03-notes-more
      • language-04-semantics
    • Videos and Notes (from 2/18):
      • Tail Recursion
      • Records and Unions
      • Trees
      • Binary Search Trees
      • Heterogenous Lists
      • Optional: Additional lecture on Tail Recursion
      • Optional: Fibonacci with Tail Recursion
      • Parse input and check syntax
      • Build tree after parsing and checking syntax
    • Highlighted links on this page
    • Canvas Notes
      • More Notes on F#
      • Notes on Programming Language Syntax
  • Exam 3
    • Date: Wednesday, 4/18.
    • Lectures:
      • language04-semantics
      • fsharp04-value-restriction
      • fsharp05-tail-recursion
      • fsharp06-parse-syntax-tree
      • language05-types
      • fsharp03-notes-more-streams
      • fsharp07-pcf
    • Videos:
      • Value Restriction
      • Parse Syntax Tree
      • Infinite Streams
      • Example of using natural semantics to derive the meaning of an expression.
    • Highlighted links on this page
    • Moodle Notes
      • Infinite Streams
      • Notes on F#'s Value Restriction
      • Notes on Programming Language Syntax
      • Notes on Natural Semantics
      • Notes on Types in Programming Languages
      • PCF Interpreter

On-line resources

• Canvas
  • Canvas site, all sections
• Class Notes Site
  • Information
  • The password for the slides is proglang.
  • List of lectures for section 01
  • List of lectures for section 02
  • List of video lecture notes for all sections. Notes for these videos are in a new classroom named videos_cop4555. You will have to find the classroom and register in it. The password is proglang. Click on the Enroll/unenroll link on the UP site and look for the class.
• Class Notes Zips
  • The above site does not allow the creation of new accounts. A ZIP file of the notes will be uploaded here.
  • Section 01a
• Mailing Lists. Your webmail address has been added to the following moderated mailing list. You can access an archive of messages from this URL. Do not post messages to the list.
  • Section 01: Cop4555u01 Mailing List
  • Section 02: Cop4555u02 Mailing List
  • Section 04: Cop4555u04 Mailing List
    You may add more than one address to the list. When adding a new e-mail, be sure to follow the instructions about placing 'confirm ######' in the body of the text. If you only reply, it might not work. This is a moderated list, so only messages that I approve will be sent to you. I will sell your e-mail address to whomever wants to buy it (just kidding).
• F# Resources
  • In addition to the Canvas notes for the course, these are good references for F#.
    1. F# Wikibooks
       Only read F# Basics, Working with Functions, Immutable Data Structures.
    2. F# for Fun and Profit
       Lots of information, but it can be hard to find the exact topic you want.
    3. F# on MSDN
       MSDN is a good reference, once you understand F#.

Assignments

• Quizes will be based on problem sets.
• Problem Set 1.
  • The quiz for problem set 1 will be on February 17 (section 01) or February 18 (section 02).
  • Upload your summary of GitHub commits by February 12, in Canvas.
• Problem Set 2.
  • The quiz for problem set 1 will be on March 6.
  • Upload your summary of GitHub commits by March 20, in Canvas.
  • These videos will help you complete the problem set questions on languages.

    Video	Notes
    Parse input and check syntax Fast forward to 7:20 to see how to check syntax on a list of tokens	fsharp06-parse-syntax-tree (slide 5)
    Build tree after parsing and checking syntax	fsharp06-parse-syntax-tree (slide 11)

• Problem Set 3.
  • The quiz for problem set 3 will be on April 15.
  • Upload your summary of GitHub commits by the day of the final exam, in Canvas.
  • Example of using natural semantics to derive the meaning of an expression.

Video Lectures

• F# Lectures
  • Notes for these videos are in a new classroom named videos_cop4555. You will have to find the classroom and register in it. The password is proglang. Click on the Enroll/unenroll link on the UP site and look for the class.
  • Intro and Environment (14:08)
  • Basic Concepts (14:35)
  • Types and Tuples (12:08)
  • Functions and Type Inference (15:38)
  • Curried Functions (10:52)
  • Lists (14:50)
  • Functions on Lists (12:41)
  • Composition and Piping (11:59)
  • Idioms (11:56)
• GitHub Information
  • Claim GitHub repo in my classroom: Claim Repo
  • GitHub Classroom Introduction (6:57)
  • GitHub Introduction (19:08)
  • Linking Visual Studio to GitHub (19:10)
  • Using command-line git to set up the repo in Visual Studio for Mac (16:29)
• F# in Visual Studio Information
  • F# in Visual Studio Introduction (22:38)
• Videos for February 18, 2019
  • Notes for these videos are in a new classroom named videos_cop4555. You will have to find the classroom and register in it. The password is proglang. Click on the Enroll/unenroll link on the UP site and look for the class.

  • Video	Notes
    Tail Recursion (16:56)	fsharp03-notes-more-recursion-tail
    Records and Unions (18:11)	fsharp03-notes-more-new-types
    Trees (14:10)	fsharp03-notes-more-new-types (slide 11)
    Binary Search Trees (15:58)	fsharp03-notes-more-new-types (slide 14)
    Heterogeneous Lists (7:35)	fsharp03-notes-more-new-types (slide 23)
    Optional: Additional lecture on Tail Recursion (14:11)	fsharp05-tail-recursion
    Optional: Fibonacci with Tail Recursion (7:16)	fsharp05-tail-recursion (slide 12)
    Parse input and check syntax Fast forward to 7:20 to see how to check syntax on a list of tokens	fsharp06-parse-syntax-tree (slide 5)
    Build tree after parsing and checking syntax	fsharp06-parse-syntax-tree (slide 11)

• Videos for February 27, 2019
  • Notes for these videos are in a new classroom named videos_cop4555. You will have to find the classroom and register in it. The password is proglang. Click on the Enroll/unenroll link on the UP site and look for the class.

  • Video	Notes
    Introduction to streams	fsharp03-notes-more-streams
    Sieve of Eratosthenes	fsharp03-notes-more-streams (slide 8)
    PCF Language	fsharp10-pcf
    PCF Semantics	fsharp10-pcf (slide 9)

• Parsing, checking syntax, building a tree. Notes for these videos are in a new classroom named videos_cop4555. You will have to find the classroom and register in it. The password is proglang. Click on the Enroll/unenroll link on the UP site and look for the class.
  • Parse input and check syntax
  • Build syntax tree
• Infinite Streams Notes for these videos are in a new classroom named videos_cop4555. You will have to find the classroom and register in it. The password is proglang. Click on the Enroll/unenroll link on the UP site and look for the class.
  • New: Introduction to streams
  • New: Sieve of Eratosthenes
• Value Restriction Notes for these videos are in a new classroom named videos_cop4555. You will have to find the classroom and register in it. The password is proglang. Click on the Enroll/unenroll link on the UP site and look for the class.
  • Subtyping, overloading and inline functions
  • Defining the value restriction
  • Imperative programming necessitates the value restriction