A revised completeness result for the simply typed λµ-calculus using realizability semantics
Résumé
In this paper, we correct some errors in [21]. We define a new realizability semantics for the simply typed λµ-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability semantics using a particular term model.
Domaines
Logique [math.LO]| Origine | Fichiers produits par l'(les) auteur(s) |
|---|