Pages that link to "Item:Q5308440"
From MaRDI portal
The following pages link to Foundations of Software Science and Computation Structures (Q5308440):
Displaying 13 items.
- Realizability models and implicit complexity (Q534712) (← links)
- Soft linear set theory (Q941435) (← links)
- Gödel's system \(\mathcal T\) revisited (Q960861) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
- Quantitative classical realizability (Q2343127) (← links)
- Natural language semantics and computability (Q2425328) (← links)
- Resource control for synchronous cooperative threads (Q2503040) (← links)
- Soft linear logic and polynomial complexity classes (Q2866738) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Polynomial Time in the Parametric Lambda Calculus. (Q5277846) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)