Pages that link to "Item:Q1259590"

The following pages link to The typed lambda-calculus is not elementary recursive (Q1259590):

Displaying 43 items.

• The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
• The complexity of higher-order queries (Q498405) (← links)
• Functional programs as compressed data (Q526441) (← links)
• The most nonelementary theory (Q598194) (← links)
• Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
• The semantics of second-order lambda calculus (Q751294) (← links)
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
• A characterization of lambda definable tree operations (Q918191) (← links)
• On the membership problem for non-linear abstract categorial grammars (Q972435) (← links)
• A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
• Word operation definable in the typed \(\lambda\)-calculus (Q1099156) (← links)
• On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems (Q1164619) (← links)
• Finitely stratified polymorphism (Q1175334) (← links)
• A simple proof of a theorem of Statman (Q1199546) (← links)
• Intuitionistic propositional logic is polynomial-space complete (Q1259589) (← links)
• Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity (Q1295429) (← links)
• Ordinals and ordinal functions representable in the simply typed lambda calculus (Q1302304) (← links)
• Functions over free algebras definable in the simply typed lambda calculus (Q1314357) (← links)
• Parallel beta reduction is not elementary recursive (Q1854460) (← links)
• (Optimal) duplication is not elementary recursive (Q1881231) (← links)
• A formal system of reduction paths for parallel reduction (Q1989338) (← links)
• An abstract approach to stratification in linear logic (Q2343125) (← links)
• Decidability of bounded higher-order unification (Q2456577) (← links)
• Ensuring termination by typability (Q2500473) (← links)
• Complexity Hierarchies beyond Elementary (Q2828216) (← links)
• A Logical Framework with Explicit Conversions (Q2871837) (← links)
• On session types and polynomial time (Q2971079) (← links)
• On Higher-Order Probabilistic Subrecursion (Q2988381) (← links)
• λ-definable functionals andβη conversion (Q3322071) (← links)
• Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (Q3558344) (← links)
• Completeness, invariance and <i>λ</i>-definability (Q3947643) (← links)
• Upper bounds for standardizations and an application (Q4254636) (← links)
• Fully abstract translations between functional languages (Q4286526) (← links)
• The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) (← links)
• An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
• The complexity of type inference for higher-order typed lambda calculi (Q4764610) (← links)
• (Q5028447) (← links)
• (Q5092325) (← links)
• Many more predecessors: A representation workout (Q5110930) (← links)
• Is the Optimal Implementation Inefficient? Elementarily Not (Q5111313) (← links)
• LAMBDA-REPRESENTABLE FUNCTIONS OVER TERM ALGEBRAS (Q5249246) (← links)
• A characterization of lambda-terms transforming numerals (Q5371970) (← links)
• Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms (Q6635503) (← links)