Pragmatic isomorphism proofs between coq representations: application to lambda-term families
Résumé
There are several ways to formally represent families of data, such as lambda terms, in a type theory such as the dependent type theory of Coq. Mathematical representations are very compact ones and usually rely on the use of dependent types, but they tend to be difficult to handle in practice. On the contrary, implementations based on a larger (and simpler) data structure combined with a restriction property are much easier to deal with.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|---|
| Licence |