Linear Dependent Types and Relative Completeness

Authors:
Ugo Dal Lago;Marco Gaboardi
Affiliations:
-;-
Venue:
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Year:
2011

Citing 0
Cited 4

Linear dependent types in a call-by-value scenario

Proceedings of the 14th symposium on Principles and practice of declarative programming
Automating relatively complete verification of higher-order functional programs

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of types

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear dependent types for differential privacy

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

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.