The following pages link to Kripke logical relations and PCF (Q1898483):
Displaying 17 items.
- Program equivalence in a simple language with state (Q456473) (← links)
- Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400) (← links)
- A characterization of lambda definability in categorical models of implicit polymorphism (Q673121) (← links)
- Full abstraction for the second order subset of an Algol-like language (Q1369235) (← links)
- Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Prelogical relations (Q1854557) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- On phase semantics and denotational semantics in multiplicative-additive linear logic (Q1971797) (← links)
- Cryptographic logical relations (Q2481976) (← links)
- A stable programming language (Q2492185) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- On phase semantics and denotational semantics: The exponentials (Q5939845) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)