A type assignment for lambda-calculus complete both for FPTIME and strong normalization

Autor: De Benedetti, Erika, Della Rocca, Simona Ronchi

One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of computer

Externí odkaz: http://arxiv.org/abs/1410.6298

Characterizing polynomial and exponential complexity classes in elementary lambda-calculus

Autor: Baillot, Patrick, De Benedetti, Erika, Ronchi Della Rocca, Simona

Publikováno v: In Information and Computation August 2018 261 Part 1:55-77

Logique linéaire, systèmes de types et complexité implicite

Autor: de Benedetti, Erika

Publikováno v: Other [cs.OH]. Ecole normale supérieure de lyon-ENS LYON; Universita degli studi (Turin, Italie), 2015. English. ⟨NNT : 2015ENSL0981⟩
Other [cs.OH]. Ecole normale supérieure de lyon-ENS LYON; Università degli studi (Torino, Italia), 2015. English. ⟨NNT : 2015ENSL0981⟩

In this thesis we explore the linear logic approach to implicit computational complexity, through the design of type assignment systems based on light linear logic, or heavily inspired by them, with the purpose of giving a characterization of one or

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c3fff6eb119522cbb2a9e830461de263
https://theses.hal.science/tel-01123737/document

Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus.

Autor: Baillot, Patrick, De Benedetti, Erika, Ronchi Della Rocca, Simona

Publikováno v: Theoretical Computer Science: 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings; 2014, p151-163, 13p