Pages that link to "Item:Q2794671"

The following pages link to (Leftmost-outermost) beta reduction is invariant, indeed (Q2794671):

Displaying 22 items.

• Complexity of the combinator reduction machine (Q1075052) (← links)
• Parallel beta reduction is not elementary recursive (Q1854460) (← links)
• Call-by-value lambda calculus as a model of computation in Coq (Q2319993) (← links)
• Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
• (In)efficiency and reasonable cost models (Q2333310) (← links)
• Classical By-Need (Q2802497) (← links)
• The Useful MAM, a Reasonable Implementation of the Strong $$\lambda $$ -Calculus (Q2820681) (← links)
• On the enumeration of closures and environments with an application to random generation (Q4972734) (← links)
• (Q4972738) (← links)
• Counting environments and closures (Q4993337) (← links)
• The Negligible and Yet Subtle Cost of Pattern Matching (Q5056004) (← links)
• A Fresh Look at the λ-Calculus (Q5089000) (← links)
• (Q5089006) (← links)
• Optimality and the linear substitution calculus (Q5111304) (← links)
• Is the Optimal Implementation Inefficient? Elementarily Not (Q5111313) (← links)
• Tight typings and split bounds, fully developed (Q5120229) (← links)
• Logical Approaches to Computational Barriers (Q5898807) (← links)
• Focused linear logic and the \(\lambda\)-calculus (Q5971394) (← links)
• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
• Factorization and normalization, essentially (Q6536313) (← links)
• Reasonable space for the \(\lambda \)-calculus, logarithmically (Q6649482) (← links)
• Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)