The following pages link to (Q4125720):
Displayed 19 items.
- Logical foundations for programming semantics (Q685420) (← links)
- Algebras for iteration and infinite computations (Q715050) (← links)
- On the fixpoints of nondeterministic recursive definitions (Q1059391) (← links)
- Relational algebraic semantics of deterministic and nondeterministic programs (Q1079010) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- CPO's of measures for nondeterminism (Q1139367) (← links)
- Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. I (Q1143165) (← links)
- Formalization of properties of nondeterministic recursive definitions (Q1148668) (← links)
- Nondeterministic flowchart programs with recursive procedures: Semantics and correctness. II (Q1152704) (← links)
- A unified approach for studying the properties of transition systems (Q1161289) (← links)
- Programs as partial graphs. I: Flow equivalence and correctness (Q1168723) (← links)
- Functional behavior in data spaces (Q1244988) (← links)
- Relation-algebraic semantics (Q1350513) (← links)
- Parallel constructions of maximal path sets and applications to short superstrings (Q1366535) (← links)
- Infinite executions of lazy and strict computations (Q2347906) (← links)
- Lazy Relations (Q3498411) (← links)
- Étude et implémentation d'un système de déduction pour logique algorithmique (Q3802671) (← links)
- Formal computations of non deterministic recursive program schemes (Q3883492) (← links)