Intersection types for light affine lambda calculus (2004)
| Venue: | In Proceedings of 3rd Workshop on Intersection Types and Related Systems (ITRS’04 |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Carvalho04intersectiontypes,
author = {Daniel De Carvalho},
title = {Intersection types for light affine lambda calculus},
booktitle = {In Proceedings of 3rd Workshop on Intersection Types and Related Systems (ITRS’04},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Light Affine Lambda Calculus is a term calculus for polynomial time computation ([12]). Some of the terms of Light Affine Lambda Calculus must however be regarded as errors. Intuitionistic Light Affine Logic (ILAL) types only terms without errors, but not all of them. We introduce two type assignment systems with intersection types: in the first one, typable pseudo-terms are exactly the terms without errors; in the second one, they are exactly those that reduce to normal terms without errors.
Citations
| 541 | Linear Logic - Girard - 1987 |
| 98 | Lambda calcul, types et modèle - KRIVINE - 1990 |
| 45 | Intuitionistic light affine logic - Asperti, Roversi |
| 37 | Soft linear logic and polynomial time - Lafont - 2004 |
| 14 | Stratified coherence spaces: a denotational semantics for Light Linear Logic - Baillot - 2004 |
| 14 | An extension of basic functionality theory for lambda-calculus - Coppo, Dezani - 1980 |
| 12 | Soft lambda-calculus: a language for polynomial time computation - Baillot, Mogbil - 2004 |
| 12 | A P-time completeness proof for light logics - Roversi - 1999 |
| 12 | Light affine lambda-calculus and polytime strong normalization - Terui |
| 9 | Della Rocca. Characterization of typings in polymorphic type discipline - Giannini, Ronchi - 1988 |
| 8 | Light affine set theory: a naive set theory of polynomial time - Terui |
| 1 | Carvalho - de - 2005 |
