The following pages link to Unary PCF is decidable (Q1274980):
Displaying 6 items.
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- (Q5028431) (← links)
- (Q5111307) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)
