Output details
11 - Computer Science and Informatics
University of Dundee
Article title
Linear dependent types and relative completeness
Type
D - Journal article
DOI
-
Title of journal
Logical Methods in Computer Science
Article number
11
Volume number
8
Issue number
4
First page of article
-
ISSN of journal
1860-5974
Year of publication
2012
Number of additional authors
1
Additional information
<11> Developed in collaboration with a colleague in Italy, this paper presents a complexity analysis using a type system based on the idea of combining linear types with dependent types. A preliminary version of this work has been presented at the conference Logic In Computer Science (LICS 2011), one of the top venue for works combining logic and computer science. The ideas presented in this paper leaded to the ETERNAL project, collaborative project between the University of Bologna, the University of Paris 7 and the Ecole Polytechnique of Paris---funded by the French INRIA ARC program 2011-2012 for 70k euro.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
