BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon-2025//talk//ADCQMM
BEGIN:VTIMEZONE
TZID:EST
BEGIN:STANDARD
DTSTART:20001029T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10;UNTIL=20061029T070000Z
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
END:STANDARD
BEGIN:STANDARD
DTSTART:20071104T030000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000402T030000
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=4;UNTIL=20060402T080000Z
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20070311T030000
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-juliacon-2025-ADCQMM@pretalx.com
DTSTART;TZID=EST:20250725T100000
DTEND;TZID=EST:20250725T103000
DESCRIPTION:What if Julia types were more than `struct`\, `Tuple`\, `Union{
 }` and `where T`?\n\nIn this talk\, I'll dare to dream of an extension of 
 Julia with powerful type features like intersection types (TypeScript)\, s
 um types (Rust)\, interface types (many languages)\, etc.\n\nWhat are the 
 implications for a user\, and for the compiler? Building on the intuition 
 of types-as-sets\, we'll build a simple subtyping algorithm\, explore the 
 consequences for inference\, and show how this all connects to real Julia 
 code.
DTSTAMP:20260512T000156Z
LOCATION:Lawrence Room 120 - REPL Main Stage
SUMMARY:An Intersection of Concerns: Extended Types for Julia - Cody Tapsco
 tt
URL:https://pretalx.com/juliacon-2025/talk/ADCQMM/
END:VEVENT
END:VCALENDAR