Full reduction in the face of absurdity

Abstract : Core calculi that model the essence of computations use full reductionsemantics to be built on solid grounds. Expressive type systems forthese calculi may use propositions to refine the notion of types, whichallows abstraction over possibly inconsistent hypotheses. To preservetype soundness, reduction must then be delayed until logical hypotheseson which the computation depends have been proved consistent. Whenlogical information is explicit inside terms, proposition variablesdelay the evaluation by construction. However, logical hypotheses may beleft implicit, for the user's convenience in a surface language orbecause they have been erased prior to computation in an internallanguage. It then becomes difficult to track the dependencies ofcomputations over possibly inconsistent hypotheses.We propose anexpressive type system with implicit coercions, consistent andinconsistent abstraction over coercions, and assumption hiding, whichprovides a fine-grained control of dependencies between computations andthe logical hypotheses they depend on. Assumption hiding opens acontinuum between explicit and implicit use of hypotheses, and restoresconfluence when full and weak reductions are mixed.
Type de document :
[Research Report] INRIA. 2014
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

Contributeur : Didier Rémy <>
Soumis le : jeudi 11 décembre 2014 - 12:24:18
Dernière modification le : mardi 20 novembre 2018 - 23:06:03
Document(s) archivé(s) le : samedi 15 avril 2017 - 08:12:27


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01093910, version 1



Gabriel Scherer, Didier Rémy. Full reduction in the face of absurdity. [Research Report] INRIA. 2014. 〈hal-01093910〉



Consultations de la notice


Téléchargements de fichiers