Pages that link to "Item:Q286953"

The following pages link to There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations (Q286953):

Displaying 2 items.

• A fully abstract semantics for concurrent constraint programming (Q1275748) (← links)
• A fixpoint theory for non-monotonic parallelism (Q1884887) (← links)