Lightning Talks II

on YouTube ↗33m

" summary

Short bursts covering: a proposal for a unified generator type that injects Hedgehog/QuickCheck-like generators and shrinkers to implement a universal forall combinator (prototype compiles and demonstrates displaying counterexamples); two type-inference tricks for effect stacks using a type-level "member" constraint and an implicit-proxy approach (cleff examples, code on ramire7); a parser-combinator fix that makes left recursion work via sharing and a with-memo combinator (BNF demo passes); GHCJS status integrated into GHC 9.8 with mscripten/node tooling; and a change to closed type-family inference that forces rethinking functional dependencies.

AI-written summary · about

" chapters (7)

1. 0:00Lightning Talks II intro
2. 2:28Property-based testing generators
3. 9:53Type inference tricks
4. 15:59Left recursion in parsers
5. 22:07Type family inference
6. 26:44GHC JS backend
7. 32:03Q&A

" related talks

• 01h 30mGHC Proposal PresentationsMatthías Páll Gissurarson, Andreas Klebinger, Joachim Breitner, Gergő Érdi · Haskell Symposium 2022
• 51mLightning TalksWAW 2024
• 06mLightning Talk Slot #4: Modularizing GHCSylvain Henry · HIW 2022
• 58mPanel discussion: Types for All: From weak to strong, from static to dynamicGilad Bracha, Felienne Hermans, Martin Odersky, Edwin Brady, Sophia Drossopoulou · Code Mesh LDN 2020
• 15mMetaprogramming with CombinatorsMahshid Shahmohammadian, Geoffrey Mainland · GPCE 2021
• 01h 06mKeynote – Edwin BradyEdwin Brady · Scheme 2019
• 40mAn Introduction to Combinator Compilers and Graph Reduction MachinesDavid Graunke · Strange Loop 2016
• 01h 38mGHC Core OptimisationsSebastian Graf · 2023 GHC Contributors' Workshop