Characterizing polynomial and exponential complexity classes in elementary lambda-calculus

被引：2
|
作者：
Baillot, Patrick [1 ]
De Benedetti, Erika [2 ]
Della Rocca, Simona Ronchi [2 ]
机构：
[1] Univ Lyon, Univ Claude Bernard Lyon 1, CNRS, ENS Lyon,LIP UMR5668, F-69342 Lyon 07, France
[2] Univ Torino, Dipartimento Informat, Turin, Italy
来源：
INFORMATION AND COMPUTATION | 2018年 / 261卷
关键词：
Implicit computational complexity; Linear logic; Lambda-calculus; LINEAR LOGIC;
D O I：
10.1016/j.ic.2018.05.005
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper an implicit characterization of the complexity classes k-EXPand k-FEXP, for k >= 0, is given, by a type assignment system for a stratified lambda-calculus, where types for programs are witnesses of the corresponding complexity class. Types are formulae of Elementary Linear Logic (ELL), and the hierarchy of complexity classes k-EXP is characterized by a hierarchy of types. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码：55 / 77
页数：23
相关论文
共 50 条
12345