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.
Document type :
Reports
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.inria.fr/hal-01093910
Contributor : Didier Rémy <>
Submitted on : Thursday, December 11, 2014 - 12:24:18 PM
Last modification on : Tuesday, November 20, 2018 - 11:06:03 PM
Long-term archiving on : Saturday, April 15, 2017 - 8:12:27 AM

File

Scherer-Remy!fich@rr2014.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01093910, version 1

Collections

Citation

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

Share

Metrics

Record views

170

Files downloads

228