CSCE 5450: Programming Languages - Spring 2017

Instructor: Paul Tarau, Professor - see my home page for contact info and office hours.

Grader: you can contact him via blackboard

course directory

Midterm exam: Tuesday, February 21 open net

Final exam: TBD cumulative, open net

Description and Objectives:

A comprehensive programming language course, with emphasis on programming paradigms and language processors - and some of their formal models like Predicate Logic  and Lambda Calculus. Hands-on work with implementations of key concepts (recursion, inheritance, unification, backtracking, type inference, infinite and  lazy data objects, threads. The course also provides a glimpse at salient features of  modern object oriented languages and an overview of language implementation techniques, run-time systems and memory management in an efficient procedural language.

Syllabus

Basics

Functional Programming Languages (Haskell)

Logic Programming Languages (Prolog)

Object Oriented Programming (Java+Scala+Swift)

Low Level Imperative Programming (C)

Concurrent Programming

Future Trends in Programming Language Design

Prerequisites: Data Structures

Recommended books and online materials:

Evaluation:

Software, tutorials and related links:

Outcomes:

  1. Understand the concepts of programming languages, with emphasis on programming paradigms and language processors.                        
  2. Have a practical understanding of commonalities and differences between major programming paradigms.   
  3. Understand the key object oriented, logic and functional programming concepts.
  4. Understand the key concepts of event driven and concurrent programming.
  5. Understand the use and implementation of modern programming language concepts like recursion, inheritance, reflection, unification, backtracking, type inference, infinite data objects, and threads. 
  6. Have some familiarity with domain-specific languages with emphasis on Internet programming languages.