addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwchatcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobegmailgoogleimageimagesinstagramlinklocation-pinmagnifying-glassmailminusmoremuplabelShape 3 + Rectangle 1outlookpersonplusprice-ribbonImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruseryahoo

Sorting, Seen Functionally _and_ Type Holes

7pm: The Hole Type and Nothing But the Type, by Stephen Compall

This talk will demonstrate GHC's new Type Holes feature, focusing on how it can help beginners learn to think about types in Haskell, and guide them in writing correct code.

8pm: Sorting algorithms through the eyes of a functional programmer, by Daniel James

Everyone knows sorting algorithms like bubble sort, insertion sort, selection sort, and quicksort. Maybe some already have an intuition that insertion and selection sort are closely related. This talk will dig into the details of folds and calculating with types. This sort of categorical, algebraic approach lets us think about algorithms and their specifications in a whole new light. In so doing, we will distill these sorts down to their essence, appreciating the duality that appears and specifying the mechanisms by which these different algorithms relate to one another.

Further reading (for those comfortable with this general approach already): http://www.cs.ox.ac.uk/people/daniel.james/sorting.html

(For those who aren't, we promise the talk will be more accessible than the paper!)

Join or login to comment.

People in this
Meetup are also in:

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy