A Type and Scope Safe Universe of Syntaxes with Binding: Their Semantics and Proofs
Almost every programming language’s syntax includes a notion of binder and corresponding bound occurrences, along with the accompanying notions of $\alpha$-equivalence, capture avoiding substitution, typing contexts, runtime environments, and so on. In the past, implementing and reasoning about programming languages required careful handling to maintain the correct behaviour of bound variables. Modern programming languages include features that enable constraints like scope safety to be expressed in types. Nevertheless, the programmer is still forced to write the same boilerplate over again for each new implementation of a scope safe operation (e.g., renaming, substitution, desugaring, printing, etc.), and then again for correctness proofs.
We present an expressive universe of syntaxes with binding and demonstrate how to (1) implement scope safe traversals once and for all by generic programming; and (2) how to derive properties of these traversals by generic proving. Our universe description, generic traversals and proofs, and our examples have all been formalised in Agda and are available in the accompanying material.
Mon 24 Sep Times are displayed in time zone: Guadalajara, Mexico City, Monterrey change
13:00 - 14:30
|Prototyping a Functional Language using Higher-Order Logic Programming: A Functional Pearl on Learning the Ways of λProlog/Makam|
|A Type and Scope Safe Universe of Syntaxes with Binding: Their Semantics and Proofs|
Guillaume AllaisRadboud University Nijmegen, Robert AtkeyUniversity of Strathclyde, James Chapman, Conor McBride, James McKinnaDOI
|Reasonably Programmable Literal Notation|
Research PapersLink to publication DOI
|Refunctionalization of Abstract Abstract Machines: Bridging the Gap between Abstract Abstract Machines and Abstract Definitional Interpreters (Functional Pearl)|