BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon-2026//talk//GBYL3S
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-juliacon-2026-GBYL3S@pretalx.com
DTSTART;TZID=CET:20260812T123000
DTEND;TZID=CET:20260812T130000
DESCRIPTION:JuliaSubtyping is a new implementation of Julia's core subtypin
 g (and intersection / type-subtraction) algorithms. This talk will motivat
 e the new implementation and explore the theory behind its operation.\n\nD
 espite being built on complex theory (SAT solvers\, QBF\, and more)\, the 
 new design attempts to be more performant and transparently correct than J
 ulia's existing implementation\, while also being straightforward to exten
 d with new kinds of reasoning. At the heart of the design a "logical core"
  is combined with a "type logic" to form the basis of the algorithm and pr
 ovides semantics rich enough to describe many interesting subtyping algori
 thms.\n\nYou can of course expect many challenges along the way. Every the
 oretician's favorite enemy (undecidability) will rear its head along our j
 ourney\, along with other practical engineering trade-offs. We'll investig
 ate performance and demonstrate how the new algorithm stands with respect 
 to the old. Finally we'll speculate about what new types of compiler reaso
 ning this kind of typing algorithm may one day support.
DTSTAMP:20260502T110652Z
LOCATION:Room 1
SUMMARY:JuliaSubtyping: A logical approach to types - Cody Tapscott
URL:https://pretalx.com/juliacon-2026/talk/GBYL3S/
END:VEVENT
END:VCALENDAR