The following pages link to Finitary PCF is not decidable (Q5958762):
Displaying 19 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- The extensional ordering of the sequential functionals (Q764278) (← links)
- Operational domain theory and topology of sequential programming languages (Q1013087) (← links)
- Natural non-dcpo domains and f-spaces (Q1023300) (← links)
- Unary PCF is decidable (Q1274980) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Decidability and syntactic control of interference (Q2481977) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Exploratory Functions on Nondeterministic Strategies, up to Lower Bisimilarity (Q2805166) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- Typing Weak MSOL Properties (Q2949449) (← links)
- (Q4585074) (← links)
- (Q5028431) (← links)
- Computing with Functionals—Computability Theory or Computer Science? (Q5479568) (← links)
