Light logics and optimal reduction: Completeness and complexity☆
Under an Elsevier user license
open archive
Keywords
Lambda calculus
Linear logic
Optimal reduction
Implicit computational complexity
Proof-nets
Light linear logic
Cited by (0)
- ☆
This is a revised and extended version of an extended abstract with the same title which appeared in the Proceedings of the 22nd Symposium on Logic in Computer Science (LICS’07).
- 1
Partially supported by projects ANR-08-BLANC-0211-01 ”COMPLICE” and PICS 5276 (CNRS).
- 2
Partially supported by a visiting professorship of Univ. Paris Nord.
- 3
Work partially carried out while this author was postdoctoral fellow of Univ. Paris Nord and Univ. Denis Diderot, Paris 7.
Copyright © 2010 Elsevier Inc. All rights reserved.