The following pages link to Computer Science Logic (Q5292634):
Displaying 8 items.
- Strong normalizability of typed lambda-calculi for substructural logics (Q1001367) (← links)
- Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) (← links)
- Strong normalization from weak normalization by translation into the lambda-I-calculus (Q1426886) (← links)
- (Q2766796) (← links)
- An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types (Q3612624) (← links)
- (Q5369470) (← links)
- Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic (Q5412171) (← links)
- The Weak Normalization of the Simply Typed se-calculus (Q5435199) (← links)