This presentation will demonstrate lessons learned from making an Ada binding to the Wayland Client API: how to leverage nested subprograms, pragma Unmodified, subpools, Gnatcheck and GPS to provide a flexible/enjoyable way of working and at the same time maximize compile-time error checking when developing sequential algorithms.