The talk was about how I got function calling to work reliably on deeply recursive union types — the stuff the industry generally says doesn't work. With qwen3-coder-next, first-try success rate was 6.75%. And the entire Qwen 3.5 model family was hitting 0% on union types due to a consistent double-stringify bug. Both ended up at 100%.
Slides are also downloadable in the article — speaker notes are written inside as slide notes if you'd like the full narrative behind each slide.