A P-Time completeness proof for light logics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1683, Issue , 1999, Pages 469-483

  Roversi, Luca ^a  

^a AIX MARSEILLE UNIVERSITÉ   (France)

Author keywords

Light affine linear logics; P Time completeness; Programming with feasible functions

Indexed keywords

AFFINE LOGIC;

COMPUTER CIRCUITS;

EID: 33845643333     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48168-0_33     Document Type: Conference Paper

References (6)

1. A. Asperti. Light Affine Logic. In Proceedings of Symposium on Logic in Computer Science LICS’98, 1998.
2. H.P. Barendregt. The Lambda Calculus. North-Holland, second edition, 1984.
3. J.-Y. Girard. Light Linear Logic. Information and Computation, 143:175-204, 1998.
4. J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
5. L. Roversi. Concrete syntax for intuitionistic light affine logic with polymorphic type assignment. In Sixth Italian Conference on Theoretical Computer Science. World Scientific, 9-11 November(Pr ato – Italy) 1998.
6. L. Roversi. A polymorphic language which is typable and poly-step. In Advances in Computing Science –ASIAN’98, volume LNCS 1538. Springer-Verlag, 8-10 December(Manila – The Philippines) 1998.