Loops under Strategies
From MaRDI portal
Recommendations
- Strategies as profunctors
- Strategies as concurrent processes
- Closed-loop strategies in continuous dynamic game with multi-level of hierarchy
- On the inference of strategies
- Dominant strategy implementability and zero length cycles
- scientific article; zbMATH DE number 7204333
- A logical structure for strategies
- Interleaving strategies
- A rewriting point of view on strategies
- Dependences in strategy logic
Cites work
- A Transformational Approach to Prove Outermost Termination Automatically
- Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
- Deciding Innermost Loops
- From Outermost Termination to Innermost Termination
- Frontiers of Combining Systems
- scientific article; zbMATH DE number 49211 (Why is no real title available?)
- scientific article; zbMATH DE number 1332639 (Why is no real title available?)
- Loop detection in term rewriting using the eliminating unfoldings
- On Proving Uniform Termination and Restricted Termination of Rewriting Systems
- Term Rewriting and All That
- Termination of string rewriting proved automatically
- Transformation techniques for context-sensitive rewrite systems
Cited in
(5)
This page was built for publication: Loops under Strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636816)