The following pages link to (Q3138547):
Displaying 18 items.
- Program equivalence in a simple language with state (Q456473) (← 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)
- Degrees of parallelism in the continuous type hierarchy (Q1391861) (← links)
- The behavior-realization adjunction and generalized homomorphic relations (Q1391868) (← links)
- Relative definability of boolean functions via hypergraphs (Q1605175) (← links)
- Projecting sequential algorithms on strongly stable functions (Q1919532) (← links)
- On phase semantics and denotational semantics in multiplicative-additive linear logic (Q1971797) (← links)
- On bisimilarity in lambda calculi with continuous probabilistic choice (Q2133169) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- The variable containment problem (Q4645807) (← links)
- Linear capabilities for fully abstract compilation of separation-logic-verified code (Q5016209) (← links)
- Full abstraction for the second order subset of an ALGOL-like language (Q5096919) (← links)
- Mechanizing logical relations (Q5890057) (← links)
- On phase semantics and denotational semantics: The exponentials (Q5939845) (← links)
- Finitary PCF is not decidable (Q5958762) (← links)
- On the expressive power of first-order boolean functions in PCF (Q5958769) (← links)
