Pages that link to "Item:Q3763571"
From MaRDI portal
The following pages link to Countable nondeterminism and random assignment (Q3763571):
Displaying 8 items.
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- On the logic of UNITY (Q673960) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Semantic models for total correctness and fairness (Q5887518) (← links)
- A category-theoretic semantics for unbounded indeterminacy (Q5887523) (← links)
- Sequential algorithms for unbounded nondeterminism (Q5971404) (← links)
