A type and scope safe universe of syntaxes with binding : their semantics and proofs
Allais, Guillaume and Atkey, Robert and Chapman, James and McBride, Conor and McKinna, James (2018) A type and scope safe universe of syntaxes with binding : their semantics and proofs. Proceedings of the ACM on Programming Languages (PACMPL), 2 (ICFP). pp. 1-30. 90. ISSN 2475-1421 (https://doi.org/10.1145/3236785)
Preview |
Text.
Filename: Allais_etal_ICFP2018_A_type_and_scope_safe_universe_of_syntaxes_with_binding.pdf
Final Published Version License: Download (396kB)| Preview |
Abstract
Almost every programming language’s syntax includes a notion of binder and corresponding bound occurrences, along with the accompanying notions of α-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.
ORCID iDs
Allais, Guillaume ORCID: https://orcid.org/0000-0002-4091-657X, Atkey, Robert ORCID: https://orcid.org/0000-0002-4414-5047, Chapman, James ORCID: https://orcid.org/0000-0001-9036-8252, McBride, Conor ORCID: https://orcid.org/0000-0003-1487-0886 and McKinna, James;-
-
Item type: Article ID code: 64841 Dates: DateEvent23 September 2018Published31 July 2018Published Online18 July 2018AcceptedSubjects: Science > Mathematics > Electronic computers. Computer science Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 23 Jul 2018 15:24 Last modified: 03 Nov 2024 02:09 URI: https://strathprints.strath.ac.uk/id/eprint/64841