BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Syntax Matters: Writing abstract computations in F# - Tomas Petric
 ek (University of Cambridge)
DTSTART:20120601T141500Z
DTEND:20120601T151500Z
UID:TALK38204@talks.cam.ac.uk
CONTACT:Dominic Orchard
DESCRIPTION:The academic literature describes a number of abstract computa
 tion types such as monads\, applicative functors and their compositions. T
 hese can be used to describe features of mainstream languages such as gene
 rators in Python or asynchronous computations in C# 5\, but working with a
 bstract computations without a convenient syntactic sugar is difficult.\n\
 nIn this paper\, we describe computation expressions\, which is a syntacti
 c sugar for working with abstract computations in F# 2.0. Unlike the do no
 tation in Haskell\, computation expressions are not tied to a single kind 
 of abstract computations. They support wider range of computations\, depen
 ding on what operations are available and they also provide greater syntac
 tic flexibility.\n\nAs a result\, F# programmers are able to use a single 
 syntactic sugar for a wider range of computations including monoidal seque
 nce generators\, monadic parsers and applicative formlets. This removes th
 e need for ad-hoc language extensions that provide “nice syntax” for o
 ne particular kind of computations.\n\nThis is a practice talk for TFP'12.
  Joint work with Don Syme.
LOCATION:SS03\, Computer Laboratory
END:VEVENT
END:VCALENDAR