Guidelines

Objective

• Individual assignment
• Study of a topic related to functional programming
• Write a report (around 6 A4 pages)
• Do a short presentation (15 mins, maximum 10 slides)

Structure of the report

0. Title, author, context (year, course, etc.)
1. Summary
2. Introduction / motivation
3. Development / examples
4. Conclusion
5. Bibliography

These as just sugestions, you may alter the structure if convenient.

Assement

Report:

• Structure: 20%
• Clarify: 20%
• Depth: 20%
• Bibliography: 10%

Presentation:

• Remaning 30% of mark
• Mandatory for obtaining any marks

Plagarism

Copying uncited text from articles, internet, etc. will lead to the disqualification of all assignments.

Themes

Data structures and algorithms

1. Hash-based containers
   • https://hackage.haskell.org/package/unordered-containers
2. Vectors
   • https://hackage.haskell.org/package/vector
3. Graph algorithms
   • e.g. DFS, Dijkstra, Union-find, topological sort
   • “Structuring Depth-First Search Algorithms in Haskell”, D.King, J.Lauchbury (1995) PDF
4. Heaps (aka Priority queues)
   • “Purely functional data structures”, C. Okasaki, chap.3.

Data formats and conversions

1. Pretty-printing
   • “A prettier printer” P. Wadler. PDF
   • https://hackage.haskell.org/package/wl-pprint-1.2.1
2. Attoparsec
   • http://hackage.haskell.org/package/attoparsec
3. Aeson
   • http://hackage.haskell.org/package/aeson
4. Pandoc
   • https://pandoc.org

Testing

1. SmallCheck, Lazy SmallCheck
   • https://www.cs.york.ac.uk/fp/smallcheck
2. Hedgehog
   • http://hackage.haskell.org/package/hedgehog
3. Doctest
   • http://hackage.haskell.org/package/doctest

Streaming

1. Conduit
   • https://hackage.haskell.org/package/conduit
2. Pipes
   • https://hackage.haskell.org/package/pipes

See also the talk “Lazy I/O and Alternatives in Haskell”:

https://skillsmatter.com/skillscasts/4230-lazy-io-and-alternatives-in-haskell

Databases

Sqlite-simple

http://hackage.haskell.org/package/sqlite-simple

(There are other alternatives; this is the simplest.)

Interfaces and frontend

1. The Elm language
   • http://elm-lang.org/
2. Functional reactive programming
   • “The Yampa arcade”, A. Courtney, H. Nilsson, J. Peterson. PDF

Web backend

Scotty

https://hackage.haskell.org/package/scotty

(There are other alternatives; this is the simplest.)

Concurrent and parallel programming

1. Evaluation strategies
   • S. Marlow, “Parallel and concurrent programming in Haskell”, Chap.2-3.
2. Software transactional memory
   • Beautiful Concurrency
     
   • S. Marlow, idem, Chap.10
3. Repa (Regular Parallel Arrays)
   • Numeric_Haskell: A Repa Tutorial
   • S. Marlow, idem, Chap.5

Types

1. Linear types
   • “Linear Haskell: practical linearity in a higher-order polymorphic language”, J.P. Bernardy et al. https://arxiv.org/abs/1710.09756
2. Dependent types
   • “A Crash course on Idris 2”, E. Brady. https://idris2.readthedocs.io/en/latest/tutorial/index.html

Functional Pearls

1. “Functional Pearl: The Zipper”, G. Huet, 1997 PDF
   • http://learnyouahaskell.com/zippers
   • https://en.wikibooks.org/wiki/Haskell/Zippers
2. “Probabilistic functional programming in Haskell”, M. Erwig and S. Kollmansberger, 2006 PDF
   • http://hackage.haskell.org/package/probability

3. “When Maybe is not good enough”, M. Spivey, 2012. PDF

4. “Composing contracts: an adventure in financial engineering”, S. Peyton Jones, J-M. Eber, J. Seward. PDF

5. “Two Can Keep a Secret, If One of Them Uses Haskell”, A. Russo. PDF