Simply Typed Lambda-Calculus Modulo Type Isomorphisms
Résumé
We define a simply typed, non-deterministic lambda-calculus where isomorphic types are equated. To this end, an equivalence relation is settled at the term level. We then provide a proof of strong normalisation modulo equivalence. Such a proof is a non-trivial adaptation of the reducibility method.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|