Light types for polynomial time computation in lambda calculus

We present a polymorphic type system for lambda calculus ensuring that well-typed programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one modality. It corresponds to a fragment of light affin...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information and computation Ročník 207; číslo 1; s. 41 - 62
Hlavní autoři:	Baillot, Patrick, Terui, Kazushige
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier Inc 2009 Elsevier
Témata:	Applied sciences Computer science; control theory; systems Exact sciences and technology General logic Implicit computational complexity Lambda calculus Light linear logic Linear logic Logic and foundations Mathematical logic, foundations, set theory Mathematics Miscellaneous Polynomial time complexity Programming theory Sciences and techniques of general use Theoretical computing Type system Light linear logic Linear logic Type system Polynomial time complexity Lambda calculus Implicit computational complexity Polynomial Translation Computer theory Polynomial time Polynomial function Computation time Proof Logic
ISSN:	0890-5401, 1090-2651
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!