| Home |
| About |
| Submission Guidelines |
| Search |
| Download |
project summary
POPLmark Challenge Via de Bruijn Indices
| Title: | POPLmark Challenge Via de Bruijn Indices |
| Author: | Stefan Berghofer |
| Submission date: | 2007-08-02 |
| Abstract: | We present a solution to the POPLmark challenge designed by Aydemir et al., which has as a goal the formalization of the meta-theory of System 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 F<:, and explain how it can be extended to also cover records and more advanced binding constructs. |
| Status: [ok] | This is the development version of this entry generated for Isabelle-16-Sep-2009. The development version might change over time and is only permanently archived at Isabelle release points. It is provided as a preview of the next upcoming release. Please refer to release versions only in citations. If the status shows [FAIL], the links below will point to the last working version if any. |
|
Proof outline Proof document |
| Browse theories |
| Download this entry |
Older releases:
|