BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230321T153000
DTEND;TZID=America/New_York:20230321T163000
DTSTAMP:20260404T200127
CREATED:20230223T220342Z
LAST-MODIFIED:20230223T220342Z
UID:8594-1679412600-1679416200@seasevents.nmsdev7.com
SUMMARY:CIS Seminar: " E=Graphs for Next-Gen Programming Language Tools"
DESCRIPTION:Building a state-of-the-art program optimizer\, synthesizer\, or verifier is still a gargantuan task for even programming language (PL) experts. Much of this challenge stems from the fact that term rewriting\, a ubiquitous approach to manipulating programs\, only works with one version of a program at a time. As a result\, the system builder must carefully consider every program manipulation\, lest they accidentally “take a wrong turn” and miss out on optimization opportunities. For non-PL-experts\, these difficulties prevent application of PL techniques to domains that might otherwise greatly benefit from them. \nThis talk will describe a data structure called the e-graph and a technique called equality saturation that together allow one to store and manipulate many equivalent versions of a program simultaneously. Recent advances like delayed congruence closure and lattice-based “e-class analyses”\, both embodied in the egg e-graph toolkit\, have made this approach fast and flexible enough for academic and industrial use in areas including deep learning\, carpentry\, 3D design\, and floating point arithmetic. This talk will also present recent discoveries that connect equality saturation to relational databases. The result is faster\, simpler\, and theoretically optimal implementations of equality saturation.
URL:https://seasevents.nmsdev7.com/event/cis-seminar-egraphs-for-next-gen-programming-language-tools/
LOCATION:Wu and Chen Auditorium (Room 101)\, Levine Hall\, 3330 Walnut Street\, Philadelphia\, PA\, 19104\, United States
ORGANIZER;CN="Computer and Information Science":MAILTO:cherylh@cis.upenn.edu
END:VEVENT
END:VCALENDAR