Light types for polynomial time computation in lambda-calculus - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Light types for polynomial time computation in lambda-calculus

Patrick Baillot
Kazushige Terui
  • Fonction : Auteur
  • PersonId : 829679

Résumé

We propose a new 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 affine logic (LAL). We show that contrarily to LAL, DLAL ensures good properties on lambda-terms: subject reduction is satisfied and a well-typed term admits a polynomial bound on the reduction by any strategy. Finally we establish that as LAL, DLAL allows to represent all polytime functions.
Fichier principal
Vignette du fichier
Dlal3004_3.pdf (248.23 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00003468 , version 1 (03-12-2004)

Identifiants

  • HAL Id : hal-00003468 , version 1

Citer

Patrick Baillot, Kazushige Terui. Light types for polynomial time computation in lambda-calculus. 2004, pp.266-275. ⟨hal-00003468⟩
106 Consultations
207 Téléchargements

Partager

Gmail Facebook X LinkedIn More