The following pages link to (Q2754137):
Displayed 16 items.
- Program equivalence in a simple language with state (Q456473) (← links)
- Functions with local state: regularity and undecidability (Q557802) (← links)
- Syntactic control of concurrency (Q817845) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- The regular-language semantics of second-order idealized ALGOL (Q1884909) (← links)
- An approach to deciding the observational equivalence of Algol-like languages (Q1886322) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- Third-order Idealized Algol with iteration is decidable (Q2474055) (← links)
- Angelic semantics of fine-grained concurrency (Q2474441) (← links)
- Games for complexity of second-order call-by-name programs (Q2570133) (← links)
- Game Semantics for Access Control (Q2805155) (← links)
- Contextual Approximation and Higher-Order Procedures (Q2811338) (← links)
- A Categorical Semantics of Higher Order Store (Q2842823) (← links)
- Regular-Language Semantics for a Call-by-Value Programming Language (Q4917052) (← links)
- Logic and Geometry of Agents in Agent-Based Modeling (Q5150306) (← links)
- A case study in programming coinductive proofs: Howe’s method (Q5236557) (← links)