[PL-sem-jr] Talk tomorrow, Mon 2/15

[Daniel Brown]

I've attached my lecture notes for anyone that couldn't make it, or
for people that did make it and want the reference.

The prose is thin but should suffice for a high-level read. If you
missed the talk, feel free to stop after page 6.

If you made the talk but were sad that we didn't have time for
comonads, pp. 7–9 will either be fun to stare at or impossible to
decode. I'll keep the comonad half on backup in case a talk falls
through later this semester—that should be a fun talk.

Thanks everyone for coming!

 Dan

On Sun, Feb 14, 2010 at 15:38, Vincent St-Amour <stamourv at ccs.neu.edu> wrote:
> Mon 2/15 Room WVH166 10:00-12:00
>
> Dan - A zoology of monads for programming
>
> Monads are an abstraction for programming with effects—things like
> state, exceptions, nondeterminism, and even continuation passing.
> Although monads are often thought of as a math trick that makes I/O
> work in Haskell, they are actually just a programming trick for
> writing simpler and more modular code. In this talk we will look at a
> variety of effectful programs, identify the redundant parts, and see
> how refactoring leads us to the structure of a monad.
>
> Time permitting, we will transfer our intuitions about monads to the
> nearby concept of comonads and briefly see how they give us an
> abstraction for programming with context dependency.
>
> _______________________________________________
> Pl-sem-jr mailing list
> Pl-sem-jr at lists.ccs.neu.edu
> https://lists.ccs.neu.edu/bin/listinfo/pl-sem-jr
>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: A zoology of monads for programming - Dan.pdf
Type: application/pdf
Size: 130213 bytes
Desc: not available
Url : http://lists.ccs.neu.edu/pipermail/pl-sem-jr/attachments/20100215/bb6e57c8/attachment-0001.pdf