Show simple item record

Authordc.contributor.authorMaillard G., Kenji
Authordc.contributor.authorLennon Bertrand, Meven
Authordc.contributor.authorTabareau, Nicolas
Authordc.contributor.authorTanter, Eric Pierre
Admission datedc.date.accessioned2022-12-20T18:25:01Z
Available datedc.date.available2022-12-20T18:25:01Z
Publication datedc.date.issued2022
Cita de ítemdc.identifier.citationProc. ACM Program. Lang.,(2022) 6, No. ICFP, Article 124es_ES
Identifierdc.identifier.other10.1145/3547655
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/189893
Abstractdc.description.abstractGradualizing the Calculus of Inductive Constructions (CIC) involves dealing with subtle tensions between normalization, graduality, and conservativity with respect to CIC. Recently, GCIC has been proposed as a parametrized gradual type theory that admits three variants, each sacrificing one of these properties. For devising a gradual proof assistant based on CIC, normalization and conservativity with respect to CIC are key, but the tension with graduality needs to be addressed. Additionally, several challenges remain: (1) The presence of two wildcard terms at any type-the error and unknown terms-enables trivial proofs of any theorem, jeopardizing the use of a gradual type theory in a proof assistant; (2) Supporting general indexed inductive families, most prominently equality, is an open problem; (3) Theoretical accounts of gradual typing and graduality so far do not support handling type mismatches detected during reduction; (4) Precision and graduality are external notions not amenable to reasoning within a gradual type theory. All these issues manifest primally in CastCIC, the cast calculus used to define GCIC. In this work, we present an extension of CastCIC called GRIP. GRIP is a reasonably gradual type theory that addresses the issues above, featuring internal precision and general exception handling. GRIP features an impure (gradual) sort of types inhabited by errors and unknown terms, and a pure (non-gradual) sort of strict propositions for consistent reasoning about gradual terms. By adopting a novel interpretation of the unknown term that carefully accounts for universe levels, GRIP satisfies graduality for a large and well-defined class of terms, in addition to being normalizing and a conservative extension of CIC. Internal precision supports reasoning about graduality within GRIP itself, for instance to characterize gradual exception-handling terms, and supports gradual subset types. We develop the metatheory of GRIP using a model formalized in Coq, and provide a prototype implementation of GRIP in Agda.es_ES
Patrocinadordc.description.sponsorshipCONICYT FONDECYT Regular Project 1190058 Inria Equipe Associee GECOes_ES
Lenguagedc.language.isoenes_ES
Publisherdc.publisherACMes_ES
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
Sourcedc.sourceProceedings of the ACM Programming Languages-PACMLPes_ES
Keywordsdc.subjectGradual typinges_ES
Keywordsdc.subjectProof assistantses_ES
Keywordsdc.subjectDependent typeses_ES
Títulodc.titleA reasonably gradual type theoryes_ES
Document typedc.typeArtículo de revistaes_ES
dc.description.versiondc.description.versionVersión publicada - versión final del editores_ES
dcterms.accessRightsdcterms.accessRightsAcceso abiertoes_ES
Catalogueruchile.catalogadorapces_ES
Indexationuchile.indexArtículo de publícación WoSes_ES


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 United States
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 United States