BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2024/newsitem/15137/11
 -October-2024-FOAM-Seminar-Andrés-Goens
DTSTAMP:20240913T154116
SUMMARY:FOAM Seminar, Andrés Goens
ATTENDEE;ROLE=Speaker:Andrés Goens
DTSTART;TZID=Europe/Amsterdam:20241011T150000
DTEND;TZID=Europe/Amsterdam:20241011T161500
LOCATION:Room L1.12, ILLC Lab42, Science Park 900,
  Amsterdam
DESCRIPTION:Abstract:  In equational reasoning, co
 ngruence closure is known for being a semi-decisio
 n procedure that’s efficient in practice. Equality
  saturation can be seen as an extension of congrue
 nce closure that allows conditional rewriting and 
 optimizing terms in the equivalence classes. It ha
 s been very successful in domains beside automated
  reasoning, like program optimisation in compilers
 . In this talk we wi...
X-ALT-DESC;FMTTYPE=text/html:\n  <p>Abstract:</p>\
 n  <p>In equational reasoning, congruence closure 
 is known for being a semi-decision procedure that’
 s efficient in practice. Equality saturation can b
 e seen as an extension of congruence closure that 
 allows conditional rewriting and optimizing terms 
 in the equivalence classes. It has been very succe
 ssful in domains beside automated reasoning, like 
 program optimisation in compilers. In this talk we
  wi...</p>\n
URL:https://events.illc.uva.nl/FOAM/posts/talk17/
CONTACT:Gregor Behnke at g.behnke at uva.nl
CONTACT:Ronald de Haan at r.dehaan at uva.nl
END:VEVENT
END:VCALENDAR