COP4555 Section 02
Principles of Programming Languages
Spring 2021

Grade Calculation
The grade for the course will be based on three types of assessments: coding evaluations (18 points), quizzes on homework examples (60 points), exams on course lectures and homework examples (120 points). The total of all points is 198.
Three Coding Evaluations
GitHub Account
Create a GitHub account go to github.com and create an account send me an email from your FIU email account containing your github username Refer to Canvas for the link to create a repo for your first assignment. Experiment with F# and post your work in your repo. Post examples from class, problem set solutions, and your own experimentations. Post often for maximum points.
A coding evaluation is a self-evaluation submitted by each student. Summarize your coding contributions in GitHub for the current problem set. I will compare your evaluation with your actual postings in GitHub and assign a grade. If you do not submit an evaluation, you will not receive any points for your coding contribution.
Coding Evaluation Weight		6 points each
Three Quizzes
Each quiz will be based on homework questions. It will have questions that are similar to questions from the homework.
Quiz Weight		20 points each
Three Exams
Each exam will have practical and theoretical problems, as well as coding in F#.
Exam Weight		40 points each
Grading Scale
The grade for the course will be based on the following scale. The scale is based on the sum of your scores on the coding evaluations, quizzes and exams.
Scale		A: 169; A-: 161; B+: 153; B: 145; B-: 137; C+: 129; C: 113; D: 90
Text
		No Textbook for this course The notes are on the Canvas page for this course.
Room and Time
(none) (none) (none) (none)

Attendance I recommend that you attend every class. Those who attend class have a better chance of passing the course.

Homework I will assign homework. The homework will not be collected and will not be graded. Some of the assessments will focus on the homework assignments. You may work together on the assignments, it will probably help you to understand them.

Prerequisites

If you do not meet the prerequisites, you will be dropped from the course during the first week. Swap out of the course now to avoid late fees.

COP-3530 Data Structures

Course Content

• Introduction to F#
  • Recursive Fibonacci Function
  • Polymorphic Function
  • Tuples as Parameters
  • Efficient Fibonacci
• Tradeoffs in Programming Language Design
  • Expressiveness
  • Implementability
  • Predictability
  • Uniformity
• The 4 R's of Programming Language Design
  • Writing
  • Reading
  • Running
  • Reasoning
• Functional Programming in F#
  • Overview
  • Programming Environments
  • Basics
  • Primitive Data Types
  • Tuples
  • Functions
    • Type Inference and Polymorphism
    • Overloaded Operators
    • Curried Functions
  • Lists
  • Rules of F# Syntax
• Programming with Recursion
  • Checklist
  • Example Using Checklist
  • Concrete Examples
  • Smaller Inputs
  • Correctness of Checklist
  • Analyzing Code with the Checklist
• Pattern Matching, Scoping, Evaluation, Efficiency
  • Pattern Matching
  • Local Declarations
  • Semantics: Scoping and Evaluation
  • QuickSort
  • Efficient Recursive Programs
  • Defining New Types
• Value Restriction Error
  • Subtyping and Overloading
  • Polymorphic Function Parameters
  • The Value Restriction
    • What is it?
    • How Do We Deal With It?
    • Why Do We Need It?
• Context-Free Grammars (CFG)
  • Formal Definition
  • Language of a CFG
  • Derivations and Parse Trees
  • Ambiguous Grammars
  • Expression Grammars
  • List Grammars
  • A Grammar for a Programming Language
• Programming Language Syntax
  • Lexical Analysis
  • Context-Free Grammar
  • Recrusive-Descent Parsing
• Natural Semantics
  • Rules for Expressions
  • Rules for Commands
• Types in Programming Languages
  • Basic Notions
  • Untyped Language
  • Dynamic Type Checking
  • Static Type Checking
  • Example of Static Type System
  • Type Soundness
  • Subtyping and Coercion
  • More Sophisticated Type Systems
• Lanuage Implementation
  • Bindings
  • Implementing Bindings
    • Textual Substitution
    • Environments
    • Implementing Environments Efficiently
    • Tail Recursion

Course Objectives

• Master programming in a functional language, such as Standard ML.
• Master programming with recursion.
• Be familiar with the use of context-free grammars to specify programming language syntax and with recursive descent parsing.
• Be familiar with natural semantics for imperative and functional programming languages and their use in building interpreters.
• Be familiar with polymorphic type systems and type inference.
• Be familiar with issues in the design and implementation of programming languages, such as lexical versus dynamic scoping and static versus dynamic type checking.