Linear dependent types and relative completeness

Ugo Dal Lago, Marco Gaboardi

    Research output: Contribution to journalArticle

    9 Citations (Scopus)

    Abstract

    A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely capture the functional behavior of PCF programs (i.e. how the output relates to the input) but also some of their intensional properties, namely the complexity of evaluating them with Krivine's Machine. dlPCF is designed around dependent types and linear logic and is parametrized on the underlying language of index terms, which can be tuned so as to sacrifice completeness for tractability.
    Original languageEnglish
    Article number11
    JournalLogical Methods in Computer Science
    Volume8
    Issue number4
    Publication statusPublished - 23 Oct 2012

    Fingerprint Dive into the research topics of 'Linear dependent types and relative completeness'. Together they form a unique fingerprint.

  • Cite this