Blogs (1) >>
POPL 2019
Sun 13 - Sat 19 January 2019 Cascais, Portugal
Sun 13 Jan 2019 11:00 - 11:50 at Sala VII - Session 2 Chair(s): Dominic Orchard

We give a survey of some recent work about type-based complexity analysis methodologies for functional programs and processes. We will focus, in particular, on techniques drawn from linear logic. The latter indeed enables, through exponential modalities, a fine control of the copying phenomenon, itself responsible for the high complexity of cut-elimination. Our journey starts from simple but intentionally very poor fragments, like light and soft linear logic, and progressively moves towards more expressive type-systems, ending up in linear dependent types, which are well-known to be relatively complete. If time permits, we will report on our ongoing work about applying linear dependent types to pi-calculus processes

Sun 13 Jan

11:00 - 12:30: BEAT 2019 - Session 2 at Sala VII
Chair(s): Dominic OrchardUniversity of Kent, UK
beat-2019-papers11:00 - 11:50
Ugo Dal LagoUniversity of Bologna, Italy / Inria, France
beat-2019-papers11:50 - 12:10
Ilaria CastellaniINRIA Sophia Antipolis, France, Mariangiola DezaniUniversità di Torino, Paola GianniniUniversita' del Piemonte Orientale, Ross HorneComputer Science and Communications Research Unit, University of Luxembourg
File Attached
beat-2019-papers12:10 - 12:30
Mauricio CanoUniversity of Groningen, The Netherlands