Pages that link to "Item:Q3190158"
From MaRDI portal
The following pages link to Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (Q3190158):
Displaying 7 items.
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- (Q5079730) (← links)
- Polynomial Time in the Parametric Lambda Calculus. (Q5277846) (← links)
- New Computational Paradigms (Q5717048) (← links)
- Polynomial and Exponential Bounded Logic Programs with Function Symbols: Some New Decidable Classes (Q5742242) (← links)