Pages that link to "Item:Q3000592"
From MaRDI portal
The following pages link to Algorithmic Nominal Game Semantics (Q3000592):
Displaying 8 items.
- Full abstraction for Reduced ML (Q388212) (← links)
- Program equivalence in a simple language with state (Q456473) (← links)
- Algorithmic games for full ground references (Q1650867) (← links)
- Reachability in pushdown register automata (Q2396722) (← links)
- ML and Extended Branching VASS (Q2988645) (← links)
- A Fragment of ML Decidable by Visibly Pushdown Automata (Q3012916) (← links)
- Full Abstraction for Reduced ML (Q3617719) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
