Linear Dependent Types and Relative Completeness - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2012

Linear Dependent Types and Relative Completeness

Résumé

A system of linear dependent types for the lambda calculus with full higher-order recursion, called dℓPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dℓPCF 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. dℓPCF 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.

Domaines

Informatique
Fichier principal
Vignette du fichier
1104.0193.pdf (436.23 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00906347 , version 1 (19-11-2013)

Identifiants

  • HAL Id : hal-00906347 , version 1

Citer

Ugo Dal Lago, Marco Gaboardi. Linear Dependent Types and Relative Completeness. Logical Methods in Computer Science, 2012, 8 (4). ⟨hal-00906347⟩

Collections

INRIA INRIA2
205 Consultations
189 Téléchargements

Partager

Gmail Facebook X LinkedIn More