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

[Daniel Brown]

Rebecca points out that I have dangling citations near the back—they
reference my internal library, of course. ;)

Below is a quick bibliography for the citations in the comonad
section. There's of course a bibliography for the monad stuff as well,
but I didn't bother including citations for myself since I'm more
familiar with that literature. If you want some pointers to particular
monad papers I'd be happy to supply those as well.

 Dan

[BG92] Brookes and Geva. Computational Comonads and Intensional
Semantics. Applications of Categories in Computer Science 1992.

[K99] Kieburtz. Codata and Comonads in Haskell. OGI Tech. Report 1999.

[LLMS00] Lewis, Launchbury, Meijer, and Sheilds. Implicit parameters:
dynamic scoping with static types. POPL 2000.

[N05] Nanevski. A modal calculus for exception handling.
Intuitionistic Modal Logics and Applications Workshop 2005.

[UV02] Uustalu and Vene. The dual of substitution is redecoration. TFP 2002.

[UV05a] Uustalu and Vene. Comonadic functional attribute evaluation. TFP 2005.

[UV05b] Uustalu and Vene. Signals and comonads. JUCS 2005.

[UV06] Uustalu and Vene. The essence of dataflow programming. Central
European Functional Programming School 2006.

[UV08] Uustalu and Vene. Comonadic notions of computation. CMCS 2008.

On Mon, Feb 15, 2010 at 15:06, Rebecca Frankel <rfrankel at mit.edu> wrote:
> You have what seem like bibliography references -- [UV05]] for instance.
> What do they reference?
>
> On Mon, Feb 15, 2010 at 1:59 PM, Daniel Brown <dbrown at ccs.neu.edu> wrote:
>>
>> 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
>> >
>>
>> _______________________________________________
>> Pl-sem-jr mailing list
>> Pl-sem-jr at lists.ccs.neu.edu
>> https://lists.ccs.neu.edu/bin/listinfo/pl-sem-jr
>>
>
>