Pages that link to "Item:Q3638274"
From MaRDI portal
The following pages link to Recognizability in the Simply Typed Lambda-Calculus (Q3638274):
Displayed 5 items.
- An alternate proof of Statman's finite completeness theorem (Q436624) (← links)
- On the expressive power of schemes (Q719245) (← links)
- The IO and OI hierarchies revisited (Q2347807) (← links)
- Finite Combinatory Logic with Intersection Types (Q3007665) (← links)
- Domains for Higher-Order Games (Q5111275) (← links)