Intersection Types for Light Affine Lambda Calculus

Authors:
Daniel de Carvalho
Affiliations:
Institut de Mathématiques de Luminy, UMR 6206, 163, avenue de Luminy, case 907, 13288 Marseille Cedex 9, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2005

Citing 6
Cited 2

Linear logic

Theoretical Computer Science
Lambda-calculus, types and models

Lambda-calculus, types and models
Light linear logic

Information and Computation
Light Affine Logic

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Stratified coherence spaces: a denotational semantics for light linear logic

Theoretical Computer Science - Implicit computational complexity
Soft linear logic and polynomial time

Theoretical Computer Science - Implicit computational complexity

A semantic measure of the execution time in linear logic

Theoretical Computer Science
Complexity of strongly normalising λ-terms via non-idempotent intersection types

FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Light Affine Lambda Calculus is a term calculus for polynomial time computation ([K. Terui. Light affine lambda calculus and polytime strong normalization. In Proceedings of LICS'01, pages 209-220, 2001]). 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.