BEGIN:VCALENDAR
PRODID;X-RICAL-TZSOURCE=TZINFO:-//Calagator//EN
CALSCALE:GREGORIAN
X-WR-CALNAME:Calagator
METHOD:PUBLISH
VERSION:2.0
BEGIN:VTIMEZONE
TZID;X-RICAL-TZSOURCE=TZINFO:America/Los_Angeles
BEGIN:DAYLIGHT
DTSTART:20100314T020000
RDATE:20100314T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
CREATED;VALUE=DATE-TIME:20100611T222816Z
DTEND;TZID=America/Los_Angeles;VALUE=DATE-TIME:20100615T113000
DTSTART;TZID=America/Los_Angeles;VALUE=DATE-TIME:20100615T103000
DTSTAMP;VALUE=DATE-TIME:20100611T222816Z
LAST-MODIFIED;VALUE=DATE-TIME:20100611T222816Z
UID:http://calagator.org/events/1250458768
DESCRIPTION:Introducing Well-Founded Recursion\nEric Mertens\n\nImplement
 ing recursive functions can be tricky when you want to be certain that t
 hey eventually terminate. This talk introduces the concept of well-found
 ed recursion as a tool for implementing recursive functions. It implemen
 ts these concepts in the Agda programming language and demonstrates the 
 technique by implementing a simple version of Quicksort.\n\nTags: functi
 onal programming\, galois\, formal methods\n\nImported from: http://cala
 gator.org/events/1250458768
URL:http://www.galois.com/blog/2010/06/11/tech-talk-introducing-well-foun
 ded-recursion/
SUMMARY:Galois Tech Talk: Introducing Well-Founded Recursion
LOCATION:Galois\, Inc: 421 SW 6th Ave. Suite 300\, Portland OR 97204 US
SEQUENCE:1
END:VEVENT
END:VCALENDAR