Skip to Main content Skip to Navigation
Journal articles

A unified treatment of syntax with binders

Abstract : Atoms and de Bruijn indices are two well-known representation techniques for data structures that involve names and binders. However, using either technique, it is all too easy to make a programming error that causes one name to be used where another was intended. We propose an abstract interface to names and binders that rules out many of these errors. This interface is implemented as a library in Agda. It allows defining and manipulating term representations in nominal style and in de Bruijn style. The programmer is not forced to choose between these styles: on the contrary, the library allows using both styles in the same program, if desired. Whereas indexing the types of names and terms with a natural number is a well-known technique to better control the use of de Bruijn indices, we index types with worlds. Worlds are at the same time more precise and more abstract than natural numbers. Via logical relations and parametricity, we are able to demonstrate in what sense our library is safe, and to obtain theorems for free about world-polymorphic functions. For instance, we prove that a world-polymorphic term transformation function must commute with any renaming of the free variables. The proof is entirely carried out in Agda.
Document type :
Journal articles
Complete list of metadata

Cited literature [50 references]  Display  Hide  Download
Contributor : François Pottier Connect in order to contact the contributor
Submitted on : Friday, January 11, 2013 - 9:19:16 AM
Last modification on : Friday, January 21, 2022 - 3:15:42 AM
Long-term archiving on: : Saturday, April 1, 2017 - 3:41:35 AM


Files produced by the author(s)




Nicolas Pouillard, François Pottier. A unified treatment of syntax with binders. Journal of Functional Programming, Cambridge University Press (CUP), 2012, 22 (4--5), pp.614--704. ⟨10.1017/S0956796812000251⟩. ⟨hal-00772721⟩



Les métriques sont temporairement indisponibles