Pages that link to "Item:Q1876088"
From MaRDI portal
The following pages link to Light affine set theory: A naive set theory of polynomial time (Q1876088):
Displayed 14 items.
- Unifying sets and programs via dependent types (Q408534) (← links)
- Type inference for light affine logic via constraints on words (Q703485) (← links)
- Stability and paradox in algorithmic logic (Q861519) (← links)
- Light affine lambda calculus and polynomial time strong normalization (Q877259) (← links)
- Soft linear set theory (Q941435) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Linear logic by levels and bounded time complexity (Q1044841) (← links)
- Routes to triviality (Q1771203) (← links)
- On arithmetic in the Cantor-Łukasiewicz fuzzy set theory (Q2388435) (← links)
- Variations on a theme of Curry (Q2505136) (← links)
- Unifying Sets and Programs via Dependent Types (Q3605541) (← links)
- MODAL LOGIC WITHOUT CONTRACTION IN A METATHEORY WITHOUT CONTRACTION (Q5216977) (← links)
- Proof-Theoretic Semantics and Feasibility (Q5250217) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)