Pages that link to "Item:Q1199546"
From MaRDI portal
The following pages link to A simple proof of a theorem of Statman (Q1199546):
Displaying 7 items.
- The complexity of higher-order queries (Q498405) (← links)
- The most nonelementary theory (Q598194) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- On session types and polynomial time (Q2971079) (← links)
- An analysis of the Core-ML language: Expressive power and type reconstruction (Q4632418) (← links)
- (Q5092325) (← links)
