A Solution to the PoplMark Challenge Based on de Bruijn Indices

The PoplMark challenge proposes a set of benchmarks intended to assess the usability of proof assistants in the context of research on programming languages. It is based on the metatheory of System F\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$_{\mathtt{<:}}$\end{document}. We present a solution to the challenge using de Bruijn indices, developed with the Coq proof assistant.