Pages that link to "Item:Q1357009"

The following pages link to Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009):

Displaying 29 items.

• Strong normalization from an unusual point of view (Q534700) (← links)
• Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
• Resource operators for \(\lambda\)-calculus (Q876041) (← links)
• On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
• Strong normalizability of typed lambda-calculi for substructural logics (Q1001367) (← links)
• Strong normalization property for second order linear logic (Q1044837) (← links)
• Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
• Strong normalization for non-structural subtyping via saturated sets (Q1351999) (← links)
• Short proofs of normalization for the simply-typed \(\lambda\)-calculus, permutative conversions and Gödel's \(\mathbf T\) (Q1407578) (← links)
• Strong normalization from weak normalization by translation into the lambda-I-calculus (Q1426886) (← links)
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: The typed case (Q1763159) (← links)
• De Bruijn's syntax and reductional behaviour of \(\lambda\)-terms: the untyped case (Q1764799) (← links)
• Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
• Conservation and uniform normalization in lambda calculi with erasing reductions (Q1854562) (← links)
• Strong normalization in type systems: A model theoretical approach (Q1891251) (← links)
• A proof of strong normalization for \(F_ 2\), \(F_ \omega\), and beyond (Q1899911) (← links)
• (Q2766796) (← links)
• Strong normalization with singleton types (Q2842835) (← links)
• A formalization of strong normalization for simply-typed lambda-calculus and System F (Q2871864) (← links)
• Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types (Q3000601) (← links)
• An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types (Q3612624) (← links)
• Strong cut-elimination in sequent calculus using Klop's <i>ι</i>-translation and perpetual reductions (Q3617369) (← links)
• The conservation theorem for differential nets (Q5360213) (← 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)
• Strong Normalisation of Cut-Elimination That Simulates β-Reduction (Q5458374) (← links)
• Weak normalization implies strong normalization in a class of non-dependent pure type systems (Q5958619) (← links)
• On the longest perpetual reductions in orthogonal expression reduction systems (Q5958775) (← links)