| Abstrakt: |
We present a solution to the P oplM ark challenge designed by Aydemir et al., which has as a goal the formalization of the meta-theory of System $\hbox{F}_{<:}$. The formalization is carried out in the theorem prover Isabelle/HOL using an encoding based on de Bruijn indices. We start with a relatively simple formalization covering only the basic features of System $\hbox{F}_{<:}$, and explain how it can be extended to also cover records and more advanced binding constructs. We also discuss different styles of formalizing the evaluation relation, and how this choice influences executability of the specification. [ABSTRACT FROM AUTHOR] |
Full text from SpringerLink