BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Reagents : combinators for writing concurrent libraries. - Theo La
 urent
DTSTART:20150728T121500Z
DTEND:20150728T124500Z
UID:TALK60250@talks.cam.ac.uk
CONTACT:Heidi Howard
DESCRIPTION:Efficient communication is crucial for the scalability of conc
 urrent algorithms. But writing efficient concurrent libraries is difficult
 . Moreover\, such libraries are generally not composable\, limiting their 
 expressive power.\nReagents are a set of combinators intended for elegantl
 y writing concurrency algorithms and data structures. They provide basic b
 locks for fine-grained communication through synchronisation and/or state 
 mutation together with combinators to compose these basic blocks into soph
 isticated programs.\nAside being easier to write\, such programs scale qui
 te as well as their handwritten counterparts and are composable\, improvin
 g modularity and expressiveness.\nWe believe reagents are an interesting c
 andidate for writing OCaml concurrent libraries and thus provided an OCaml
  implementation for reagents.
LOCATION:Computer Laboratory\, William Gates Building\, Room FW11
END:VEVENT
END:VCALENDAR