The following pages link to Joseph M. Morris (Q199021):
Displaying 21 items.
- Non-deterministic expressions and predicate transformers (Q287006) (← links)
- A theoretical basis for stepwise refinement and the programming calculus (Q578892) (← links)
- Terms with unbounded demonic and angelic nondeterminacy (Q870280) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- Dual unbounded nondeterminacy, recursion, and fixpoints (Q995749) (← links)
- Laws of data refinement (Q1113664) (← links)
- Temporal predicate transformers and fair termination (Q1120264) (← links)
- Traversing binary trees simply and cheaply (Q1133898) (← links)
- A starvation-free solution to the mutual exclusion problem (Q1253914) (← links)
- Partiality and nondeterminacy in program proofs (Q1271855) (← links)
- (Q1347993) (redirect page) (← links)
- A source of inconsistency in theories of nondeterministic functions (Q1347995) (← links)
- E3: A logic for reasoning equationally in the presence of partiality (Q1806134) (← links)
- (Q3038594) (← links)
- (Q3038595) (← links)
- (Q3314968) (← links)
- A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes (Q3525145) (← links)
- (Q4746768) (← links)
- Mathematics of Program Construction (Q5313090) (← links)
- (Q5783773) (← links)
- A theory of bunches (Q5941635) (← links)
