Pages that link to "Item:Q1286373"

The following pages link to Perpetual reductions in \(\lambda\)-calculus (Q1286373):

Displaying 17 items.

• A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
• A note on preservation of strong normalisation in the \(\lambda \)-calculus (Q631760) (← links)
• On strong normalization and type inference in the intersection type discipline (Q930868) (← links)
• Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
• Non-strictly positive fixed points for classical natural deduction (Q1772778) (← links)
• Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) (← links)
• Conservation and uniform normalization in lambda calculi with erasing reductions (Q1854562) (← links)
• On randomised strategies in the \(\lambda \)-calculus (Q1989325) (← links)
• A Knuth-Bendix-like ordering for orienting combinator equations (Q2096451) (← links)
• Weak linearization of the lambda calculus (Q2566028) (← links)
• Normalization for the Simply-Typed Lambda-Calculus in Twelf (Q2871835) (← links)
• Polarised subtyping for sized types (Q3535676) (← links)
• Strong cut-elimination in sequent calculus using Klop's <i>ι</i>-translation and perpetual reductions (Q3617369) (← links)
• Tight typings and split bounds, fully developed (Q5120229) (← links)
• (Q5208874) (← links)
• Strong Normalisation of Cut-Elimination That Simulates β-Reduction (Q5458374) (← links)
• On the longest perpetual reductions in orthogonal expression reduction systems (Q5958775) (← links)