Work

Linear Dependent Types and Relative Completeness

Year: 2012

Type: article

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 behaviour 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.

Source: Logical Methods in Computer Science

DOI: 10.2168/lmcs-8(4:11)2012

Authors: Ugo Dal Lago, Marco Gaboardi

Institutions: Institut national de recherche en sciences et technologies du numérique, University of Bologna, University of Pennsylvania

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

Funders: Institut national de recherche en informatique et en automatique (INRIA), European Commission

Award: PRACTICAL LIGHT TYPES FOR RESOURCE CONSUMPTION