Joseph M. Morris

Publication Activity (10 Years)

Years Active: 1979-2009
Publications (10 Years): 0

Publications

Joseph M. Morris, Alexander Bunkenburg, Malcolm Tyrrell
Term transformers: A new approach to state. ACM Trans. Program. Lang. Syst. 31 (4) (2009)
Joseph M. Morris, Malcolm Tyrrell
Modelling higher-order dual nondeterminacy. Acta Informatica 45 (6) (2008)
Joseph M. Morris, Malcolm Tyrrell
Dually nondeterministic functions. ACM Trans. Program. Lang. Syst. 30 (6) (2008)
Joseph M. Morris, Malcolm Tyrrell
Dual unbounded nondeterminacy, recursion, and fixpoints. Acta Informatica 44 (5) (2007)
Joseph M. Morris, Malcolm Tyrrell
Terms with unbounded demonic and angelic nondeterminacy. Sci. Comput. Program. 65 (2) (2007)
Joseph M. Morris
Plug-and-Play Nondeterminacy. B (2007)
Malcolm Tyrrell, Joseph M. Morris, Andrew Butterfield, Arthur Hughes
A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes. ICTAC (2006)
Gareth Carter, Rosemary Monahan, Joseph M. Morris
Software Refinement with Perfect Developer. SEFM (2005)
Joseph M. Morris
Augmenting Types with Unbounded Demonic and Angelic Nondeterminacy. MPC (2004)
Joseph M. Morris, Alexander Bunkenburg
A source of inconsistency in theories of nondeterministic functions. Sci. Comput. Program. 43 (1) (2002)
Joseph M. Morris, Alexander Bunkenburg
A theory of bunches. Acta Informatica 37 (8) (2001)
Joseph M. Morris, Alexander Bunkenburg
Specificational functions. ACM Trans. Program. Lang. Syst. 21 (3) (1999)
Joseph M. Morris, Alexander Bunkenburg
A Logic for Reasoning Equationally in the Presence of Partiality. Sci. Comput. Program. 34 (2) (1999)
Joseph M. Morris, Alexander Bunkenburg
Partiality and Nondeterminacy in Program Proofs. Formal Aspects Comput. 10 (1) (1998)
Joseph M. Morris
Non-Deterministic Expressions and Predicate Transformers. Inf. Process. Lett. 61 (5) (1997)
Joseph M. Morris
Programming by Expression Refinement: a Sequence of Examples. Struct. Program. 11 (4) (1990)
Joseph M. Morris
Temporal Predicat Transformers and Fair Termination. Acta Informatica 27 (4) (1990)
Joseph M. Morris
Well-founded induction and the invariance theorem for loops. Inf. Process. Lett. 32 (3) (1989)
Joseph M. Morris
Laws of Data Refinement. Acta Informatica 26 (4) (1989)
Joseph M. Morris
Varieties of Weakest Liberal Preconditions. Inf. Process. Lett. 25 (3) (1987)
Joseph M. Morris
A Theoretical Basis for Stepwise Refinement and the Programming Calculus. Sci. Comput. Program. 9 (3) (1987)
Joseph M. Morris, Mayer D. Schwartz
The design of a language-directed editor for block-structured languages. ACM SIGPLAN Notices 16 (6) (1981)
Joseph M. Morris
Traversing Binary Trees Simply and Cheaply. Inf. Process. Lett. 9 (5) (1979)
Joseph M. Morris
A Starvation-Free Solution to the Mutual Exclusion Problem. Inf. Process. Lett. 8 (2) (1979)