Pages that link to "Item:Q2973243"
From MaRDI portal
The following pages link to Simply typed fixpoint calculus and collapsible pushdown automata (Q2973243):
Displaying 7 items.
- Types from Frames as Finite Automata (Q2835042) (← links)
- Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
- Homogeneity without loss of generality (Q4993359) (← links)
- (Q5109508) (← links)
- The Complexity of the Diagonal Problem for Recursion Schemes (Q5136337) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- Simply typed convertibility is \textsc{Tower}-complete even for safe lambda-terms (Q6635503) (← links)