Pages that link to "Item:Q1827397"

The following pages link to Soft linear logic and polynomial time (Q1827397):

Displaying 15 items.

• The role of polymorphism in the characterisation of complexity by soft types (Q276263) (← links)
• A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
• Bounded combinatory logic and lower complexity (Q276270) (← links)
• Light linear logics with controlled weakening: expressibility, confluent strong normalization (Q408540) (← links)
• Linear logical relations and observational equivalences for session-based concurrency (Q476190) (← links)
• Realizability models and implicit complexity (Q534712) (← links)
• Phase semantics and decidability of elementary affine logic (Q596037) (← links)
• Type inference for light affine logic via constraints on words (Q703485) (← links)
• Soft linear set theory (Q941435) (← links)
• A semantic proof of polytime soundness of light affine logic (Q987375) (← links)
• Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
• Quantum implicit computational complexity (Q1044836) (← links)
• Linear logic by levels and bounded time complexity (Q1044841) (← links)
• Paths-based criteria and application to linear logic subsystems characterizing polynomial time (Q1640980) (← links)
• Linear and affine logics with temporal, spatial and epistemic operators (Q2368991) (← links)