On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy

Elementary linear logic is a simple variant of linear logic due to Girard and which characterizes in the proofs-as-programs approach the class of elementary functions, that is to say functions computable in time bounded by a tower of exponentials of fixed height. Other systems like light and soft li...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 241; s. 3 - 31
Hlavný autor:	Baillot, Patrick
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.04.2015 Elsevier
Predmet:	Computer Science Implicit computational complexity Lambda-calculus Linear logic Logic in Computer Science Polynomial time complexity Type systems Linear logic Polynomial time complexity Type systems Implicit computational complexity Lambda-calculus
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!