Explicit substitutions and reducibility

Journal of Logic and Computation

Volumn 11, Issue 3, 2001, Pages 431-451

  Herbelin, H ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

calculus; Explicit substitutions; Reducibility; Strong normalization

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATHEMATICAL OPERATORS; THEOREM PROVING;

EXPLICIT SUBSTITUTIONS; STRONG NORMALIZATION (SN);

SET THEORY;

EID: 0035358068     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/11.3.431     Document Type: Article

References (30)

1. A symmetric lambda-calculus for 'classical' proof extraction
2. Preservation of strong normalization in named lambda-calculi with explicit substitution and garbage collection
3. Combinatory reduction systems with explicit substitution that preserve strong normalization
4. Perpetuality in a named lambda calculus with explicit substitutions
5. Categorical Combinators
6. The duality of computation
7. A new deconstructive logic: Linear logic
8. l-calculus
9. Strong normalization of explicit substitutions via cut elimination in proof nets
10. Proof nets and explicit substitutions
11. Mathematical Intuitionism: Introduction to Proof Theory
12. Investigations into logical deduction
13. Linear logic
14. A lambda-calculus structure isomorphic to sequent calculus structure
15. Explicit Substitutions and Reducibility
16. A λ-calculus à la de Bruijn with explicit substitutions
17. From λσ to λv: A journey through calculi of explicit substitutions
18. Explicit substitutions with de Bruijn levels
19. A new formula for the execution of categorical combinators
20. λμ-calculus: An algorithmic interpretation of classical natural deduction
21. Strong normalization for second order classical natural deduction
22. Call-by-name, call-by-value and the lambda-calculus
23. Characterising explicit substitutions which preserve termination
24. Intensional interpretation of functionals of finite types I
25. Strong normalization of cut-elimination in classical logic