Reference Material

There is no required textbook for this course. Electronic reference material will be provided here as the term progresses.

Note: The main or “required” material is also mirrored locally whenever this is permitted by the license of the respective material. Note however that such a material has its own license and so is not necessarily covered by the site license.

Functional Programming

• Main resources (“required”):
  • Notes on Functional Programming with Haskell by H. Conrad Cunningham (local copy).

    Class coverage: Sections 2, 3, 5, 6, 7, 8, and 15.

  • A Gentle Introduction to Haskell 98 by Paul Hudak, John Peterson, and Joseph Fasel (local copy).

    Class coverage: all but Sections 6.3, 7, 9, and 13.

  • A Tutorial Introduction to the Lambda Calculus by Raúl Rojas

• Other resources:
  • Hoogle: a Haskell API search engine.
    • The standard Prelude consists in all the functions that are guaranteed to be available in any Haskell implementation.
  • Why Functional Programming Matters by John Hughes.
  • Haskell in Practice
  • On recursion and more: The Perils of JavaSchools

Logic Programming

• Main resources (“required”):
  • Prolog Programming: A First Course by Paul Brna. Note that the original location is no longer up (has been down since early 2019) a local copy is therefore available despite the unclear license.

    Class coverage: Chapters 2, 3, 4, 5, 6, and Section 7.2.

• Other resources:
  • On-Line Guide to Prolog Programming by Roman Barták.
  • prolog :- tutorial by J. R. Fischer.
  • Prolog Tutorial by Anthony Aaby.
  • The Database of 1000 Prolog Applications (unfortunately extremely outdated)
  • For the enthusiasts the following texts are available in the library:
    • W. F. Clocksin and C. S. Mellish: Programming in Prolog, Springer, 4th edition, 1994. Call number QA 76.73 .P76 C57 1987.
    • L. Sterling and E. Shapiro: The Art of Prolog, Advanced Programming Techniques, The MIT Press, 2nd edition, 1994. Call number QA 76.73 .P76 S74 1994

Scanning and Parsing

• Main resources (“required”):
  • Lecture Notes on Regular Languages and Finite Automata by Andrew M. Pitts (not mirrored locally since license is unknown).

    Class coverage: Chapter 1 and Section 2.1. The rest of the text may be interesting to read (but is not required).

  • Introduction to Grammars and Language Analysis by Zerksis D. Umrigar (not mirrored locally since license is unknown).

  • Introduction to Recursive Descent Parsing by Zerksis D. Umrigar (not mirrored locally since license is unknown).

  • A Simple Recursive Descent Parser from Introduction to Programming Using Java, Seventh Edition by David J. Eck (not mirrored locally since it is a small chapter from a fairly large book).

    Note that this presentation uses Java, though the principles and algorithms are the same.

• Other resources:
  • Formal grammars and Top down parsing from Stanford's Compilers course
  • Parsing Expressions by Recursive Descent by Theodore Norvell
  • Some Notes on Grammars and Parsing by Michael Erdmann (quick introduction to context-free grammars and parsing)

Semantic Analysis

• Main resources (“required”):
  • Syntax-Directed Translation and Semantic Analysis fromStanford's Compilers course (not mirrored locally since license is unknown).
  • Type checking by Marc Moreno Maza (license unknown)

• Other resources:
  • Styles of Syntax-Directed Translation
  • Type checking by Aarne Ranta

Types and Classes

• Main resources (“required”):
  • Object-Oriented Programming Versus Abstract Data Types by William R. Cook
  • 4 major principles of Object-Oriented Programming

• Other resources:
  • Abstract Data Types

Note: I am assuming that OOP principles are already known and so I have not provides references for that.

Subprograms

• Main resources (“required”): Fundamentals of Subprograms and Implementing Subprograms by Thomas R. Turner

Pointers

• Main resources (“required”):
  • C++ : Understanding pointers by Lubos Rendek
  • Smart Pointers - What, Why, Which? by Yonat Sharon