Show simple item record

dc.contributor.authorDunfield, Joshua
dc.contributor.authorKrishnaswami, Neel
dc.date.accessioned2019-01-17T12:53:24Z
dc.date.available2019-01-17T12:53:24Z
dc.date.issued2019-01-02
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/288130
dc.description.abstract<jats:p>Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its applicability to a variety of type systems, its error reporting, and its ease of implementation. Following principles from proof theory, bidirectional typing can be applied to many type constructs. The principles underlying a bidirectional approach to indexed types (generalized algebraic datatypes) are less clear. Building on proof-theoretic treatments of equality, we give a declarative specification of typing based on focalization. This approach permits declarative rules for coverage of pattern matching, as well as support for first-class existential types using a focalized subtyping judgment. We use refinement types to avoid explicitly passing equality proofs in our term syntax, making our calculus similar to languages such as Haskell and OCaml. We also extend the declarative specification with an explicit rules for deducing when a type is principal, permitting us to give a complete declarative specification for a rich type system with significant type inference. We also give a set of algorithmic typing rules, and prove that it is sound and complete with respect to the declarative system. The proof requires a number of technical innovations, including proving soundness and completeness in a mutually recursive fashion.</jats:p>
dc.description.sponsorshipEPSRC grant EP/N02706X/2
dc.languageen
dc.publisherAssociation for Computing Machinery (ACM)
dc.rightsAttribution 4.0 International
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/
dc.titleSound and complete bidirectional typechecking for higher-rank polymorphism with existentials and indexed types
dc.typeConference Object
prism.endingPage28
prism.issueIdentifierPOPL
prism.publicationDate2019
prism.publicationNameProceedings of the ACM on Programming Languages
prism.startingPage1
prism.volume3
dc.identifier.doi10.17863/CAM.35446
dcterms.dateAccepted2018-10-30
rioxxterms.versionofrecord10.1145/3290322
rioxxterms.versionVoR
rioxxterms.licenseref.urihttp://creativecommons.org/licenses/by/4.0/
rioxxterms.licenseref.startdate2019-01-02
dc.contributor.orcidKrishnaswami, Neel [0000-0003-2838-5865]
dc.identifier.eissn2475-1421
dc.publisher.urlhttps://dl.acm.org/citation.cfm?id=3290322
rioxxterms.typeConference Paper/Proceeding/Abstract
pubs.funder-project-idEngineering and Physical Sciences Research Council (EP/N02706X/2)
pubs.conference-namePrinciples of Programming Languages (POPL 2019)
pubs.conference-start-date2019-01-13
cam.orpheus.successThu Nov 05 11:53:21 GMT 2020 - The item has an open VoR version.
pubs.conference-finish-date2019-01-19
rioxxterms.freetoread.startdate2100-01-01


Files in this item

Thumbnail
Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International
Except where otherwise noted, this item's licence is described as Attribution 4.0 International