Pages that link to "Item:Q1640981"
From MaRDI portal
The following pages link to Characterizing polynomial and exponential complexity classes in elementary lambda-calculus (Q1640981):
Displaying 9 items.
- A type assignment for \(\lambda\)-calculus complete both for FPTIME and strong normalization (Q276268) (← links)
- On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy (Q2343123) (← links)
- (Q3142166) (← links)
- Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (Q3190158) (← links)
- (Q5092325) (← 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)
- On basic feasible functionals and the interpretation method (Q6629518) (← links)