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...

Full description

Saved in:

Bibliographic Details
Published in:	Information and computation Vol. 207; no. 1; pp. 41 - 62
Main Authors:	Baillot, Patrick, Terui, Kazushige
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier Inc 2009 Elsevier
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!