Dependent Ghosts Have a Reflection for Free - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2024

Dependent Ghosts Have a Reflection for Free

Résumé

We introduce ghost type theory (GTT) a dependent type theory extended with a new universe for ghost data that can safely be erased when running a program but which is not proof irrelevant like with a universe of (strict) propositions. Instead, ghost data carry information that can be used in proofs or to discard impossible cases in relevant computations. Casts can be used to replace ghost values by others that are propositionally equal, but crucially these casts can safely be ignored for conversion. We provide a type-preserving erasure procedure which gets rid of all ghost data and proofs, a step which may be used as a first step to program extraction. We give a syntactical model of GTT using a program translation akin to the parametricity translation and thus show consistency of the theory. Because it is a parametricity model, it can also be used to derive free theorems about programs using ghost code. We further extend GTT to support equality reflection and show that we can eliminate its use without the need for the usual extra axioms of function extensionality and uniqueness of identity proofs. In particular we validate the intuition that indices of inductive types—such as the length index of vectors—do not matter for computation and can safely be considered modulo theory. The results of the paper have been formalised in Coq.
Fichier principal
Vignette du fichier
ghost-tt-icfp24.pdf (637.95 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04163836 , version 1 (17-07-2023)
hal-04163836 , version 2 (29-02-2024)

Licence

Paternité

Identifiants

  • HAL Id : hal-04163836 , version 2

Citer

Théo Winterhalter. Dependent Ghosts Have a Reflection for Free. 2024. ⟨hal-04163836v2⟩
103 Consultations
122 Téléchargements

Partager

Gmail Facebook X LinkedIn More