Pages that link to "Item:Q877259"

The following pages link to Light affine lambda calculus and polynomial time strong normalization (Q877259):

Displaying 12 items.

• A semantic account of strong normalization in linear logic (Q276260) (← links)
• Type inference for light affine logic via constraints on words (Q703485) (← links)
• Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
• Quantum implicit computational complexity (Q1044836) (← links)
• Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
• Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
• On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
• An Elementary Affine λ-Calculus with Multithreading and Side Effects (Q3007663) (← links)
• A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
• A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
• Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
• Implicit computation complexity in higher-order programming languages (Q5875893) (← links)