A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Mechanized Metatheory Revisited: An Extended Abstract (Invited Paper)
2018
Types for Proofs and Programs
Proof assistants and the programming languages that implement them need to deal with a range of linguistic expressions that involve bindings. Since most mature proof assistants do not have built-in methods to treat this aspect of syntax, many of them have been extended with various packages and libraries that allow them to encode bindings using, for example, de Bruijn numerals and nominal logic features. I put forward the argument that bindings are such an intimate aspect of the structure of
doi:10.4230/lipics.types.2016.1
dblp:conf/types/Miller16
fatcat:ryflgp5aqvh4pjd7x6jff3keky