Pages that link to "Item:Q2871864"
From MaRDI portal
The following pages link to A formalization of strong normalization for simply-typed lambda-calculus and System F (Q2871864):
Displaying 14 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)
- Strong normalization in type systems: A model theoretical approach (Q1891251) (← links)
- Strong normalization for the simply-typed lambda calculus in constructive type theory using Agda (Q2229159) (← links)
- (Q2766796) (← links)
- Normalization for the simply-typed lambda-calculus in Twelf (Q2871835) (← links)
- An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types (Q3612624) (← links)
- (Q4323124) (← links)
- Free Theorems and Runtime Type Representations (Q5262947) (← links)
- (Q5369470) (← links)
- Strong Normalization of a Typed Lambda Calculus for Intuitionistic Bounded Linear-time Temporal Logic (Q5412171) (← links)
- (Q5714454) (← links)
- A Formal Proof of the Strong Normalization Theorem for System T in Agda (Q6118750) (← links)