John Staples

Publication Activity (10 Years)

Years Active: 1974-1996
Publications (10 Years): 0

Publications

Lin Zucconi, Greg Royle, Karl Reed, John Staples
Do Formal Methods Really Work? Australian Software Engineering Conference (1996)
John Staples
Verification, Validation and the Future of Software Engineering. Australian Software Engineering Conference (1996)
C. Barry Jay, John Staples
Preface: Theoretical Computer Science in Australia and New Zealand. Theor. Comput. Sci. 169 (1) (1996)
H. Becht, John Staples
Soft Typing of General First-Order Languages. APSEC (1995)
John Staples, Peter J. Robinson, Daniel Hazel
A Functional Logic for Higher Level Reasoning About Computation. Formal Aspects Comput. 6 (1) (1994)
Peter J. Robinson, John Staples, Anthony S. K. Cheng
Theorem Proving Applications for QU-Prolog. ICLP Workshop: Proof-Theoretical Extensions on Logic Programming (1994)
Jian Chen, John Staples
Defining Soft Sortedness by Abstract Interpretation. MFCS (1993)
Peter J. Robinson, John Staples
Formalizing a Hierarchical Structure of Practical Mathematical Reasoning. J. Log. Comput. 3 (1) (1993)
Jian Chen, John Staples
Soft Sorting in Logic Programming. ALPUK (1992)
Peter Kearney, John Staples, Abdu Abbas
Functional Verification of Hard Real-Time Programs. IFIP Congress (1) (1992)
Peter Kearney, John Staples
An Extensional Fixed-Point Semantics for Nondeterministic Data Flow. Theor. Comput. Sci. 91 (2) (1991)
Anthony S. K. Cheng, Peter J. Robinson, John Staples
Higher Level Meta Programming in Qu-Prolog 3: 0. ICLP (1991)
John Staples, Peter J. Robinson
Structure Sharing for Quantified Terms: Fundamentals. J. Autom. Reason. 6 (2) (1990)
John Staples, Peter J. Robinson, R. A. Paterson, R. A. Hagen, A. J. Craddock, P. C. Wallis
Qu-Prolog: An Extended Prolog for Meta Level Programming. META (1988)
John Staples, Peter J. Robinson
Efficient Unification of Quantified Terms. J. Log. Program. 5 (2) (1988)
John Staples
Delaying Unification Algorithms for Lambda Calculi. Theor. Comput. Sci. 56 (1988)
John Staples, Peter J. Robinson
Unification of quantified terms. Graph Reduction (1986)
John Staples, V. L. Nguyen
A Fixpoint Semantics for Nondeterministic Data Flow J. ACM 32 (2) (1985)
John Staples, V. L. Nguyen
Computing the Behaviour of Asynchronous Processes. Theor. Comput. Sci. 26 (1983)
John Staples
Two-level expression representation for faster evaluation. Graph-Grammars and Their Application to Computer Science (1982)
Leslie M. Goldschlager, Ralph A. Shaw, John Staples
The Maximum Flow Problem is Log Space Complete for P. Theor. Comput. Sci. 21 (1982)
Hartmut Ehrig, John Staples
Church-Rosser properties for graph replacement systems with unique splitting. Graph-Grammars and Their Application to Computer Science (1982)
Peter Eades, John Staples
On Optimal Trees. J. Algorithms 2 (4) (1981)
John Staples
Efficient Combinatory Reduction. Math. Log. Q. 27 (25-30) (1981)
John Staples
Speeding up Subtree Replacement Systems. Theor. Comput. Sci. 11 (1980)
John Staples
Computation on Graph-Like Expressions. Theor. Comput. Sci. 10 (1980)
John Staples
Optimal Evaluations of Graph-Like Expressions. Theor. Comput. Sci. 10 (1980)
John Staples
A Graph-Like Lambda Calculus for Which Leftmost-Overmost Reduction is Optimal. Graph-Grammars and Their Application to Computer Science and Biology (1978)
John Staples
Truth in constructive metamathematics. Notre Dame J. Formal Log. 19 (3) (1978)
John Staples
Combinator Realizability of a Constructive Morse Set Theory. J. Symb. Log. 39 (2) (1974)