John Staples

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