Back to Results
First PageMeta Content
Complexity classes / Proof theory / Structural complexity theory / Curry–Howard correspondence / Type theory / NP / Time complexity / Reduction / Linear logic / Theoretical computer science / Computational complexity theory / Applied mathematics


On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL)
Add to Reading List

Document Date: 2015-05-05 07:12:16

Open Document

File Size: 238,20 KB

Share Result on Facebook

City

Lyon / Paris / /

Company

ST AB / /

IndustryTerm

type systems / /

Person

Andrea Asperti / Luca Vercelli / Vincent Danos / Yves Lafont / Luca Roversi / Neil D. Jones / Jean-Yves Girard / Patrick Baillot / Simona Ronchi Della Rocca / Ugo Dal Lago / Jean-Yves Marion / Jean-Baptiste Joinet / Kazushige Terui / Brunel Terui / Marco Gaboardi / /

Position

author / /

ProgrammingLanguage

FP / /

PublishedMedium

Theoretical Computer Science / /

Technology

simulation / /

SocialTag