By Conor McBride and James McKinna, from Haskell Workshop 2004, available from Conor McBride’s website:
In this paper, we show how to manipulate syntax with binding using a mixed representation of names for free variables (with respect to the task in hand) and de Bruijn indices  for bound variables. By doing so, we retain the advantages of both representations: naming supports easy, arithmetic-free manipulation of terms; de Bruijn indices eliminate the need for α-conversion. Further, we have ensured that not only the user but also the implementation need never deal with de Bruijn indices, except within key basic operations.
Moreover, we give a hierarchical representation for names which naturally reflects the structure of the operations we implement. Name choice is safe and straightforward. Our technology combines easily with an approach to syntax manipulation inspired by Huet’s ‘zippers'.Without the ideas in this paper, we would have struggled to implement EPIGRAM . Our example-constructing inductive elimination operators for datatype families-is but one of many where it proves invaluable.