Light Affine Lambda Calculus and polytime strong normalization

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 209-220

  Terui, K ^a  

^a KEIO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DIFFERENTIATION (CALCULUS); FUNCTION EVALUATION; LINEARIZATION; NORMAL DISTRIBUTION; POLYNOMIAL APPROXIMATION; THEOREM PROVING;

INTUITIONISTIC LIGHT AFFINE LOGIC; LIGHT AFFINE LAMBDA CALCULUS; LIGHT LINEAR LOGIC; POLYNOMIAL-TIME STRONG NORMALIZATION;

FORMAL LOGIC;

EID: 0034858679     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Computational interpretations of linear logic
2. Light affine logic
3. Intuitionistic light affine logic (proof-nets, normalization complexity, expressive power, programming notation)
4. Stratified coherent spaces: A denotational semantics for light linear logic
5. Lambda calculi with types
6. New recursion-theoretic characterization of the polytime functions
7. Ramification, modality and linearity in higher type recursion
8. Light linear logic
9. Phase semantics for light linear logic
10. A foundational delineation of polytime
11. Applicative control and computational complexity
12. Lambda calculus characterizations of poly-time
13. Ramified recurrence and computational complexity I: Word recurrence and poly-time
14. Can safe recursion be interpreted in light logic?
15. Discreet games, light affine logic and ptime computation
16. A P-time completeness proof for light logics
17. Light affine logic as a programming language: A first contribution
18. A syntax for linear logic
19. Typability and type-checking in the second-order calculus are equivalent and undecidable