John Staples

According to our database, John Staples authored at least 30 papers between 1974 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1996

Preface: Theoretical Computer Science in Australia and New Zealand.

C. Barry Jay, John Staples

Theor. Comput. Sci., 1996

Do Formal Methods Really Work?

Lin Zucconi, Greg Royle, Karl Reed, John Staples

Proceedings of the 1996 Australian Software Engineering Conference (ASWEC '96), 1996

Verification, Validation and the Future of Software Engineering.

John Staples

Proceedings of the 1996 Australian Software Engineering Conference (ASWEC '96), 1996

1995

Soft Typing of General First-Order Languages.

H. Becht, John Staples

Proceedings of the 2nd Asia-Pacific Software Engineering Conference (APSEC '95), 1995

1994

A Functional Logic for Higher Level Reasoning About Computation.

John Staples, Peter J. Robinson, Daniel Hazel

Formal Aspects Comput., 1994

Theorem Proving Applications for QU-Prolog.

Peter J. Robinson, John Staples, Anthony S. K. Cheng

Proceedings of the ICLP 1994, 1994

1993

Formalizing a Hierarchical Structure of Practical Mathematical Reasoning.

Peter J. Robinson, John Staples

J. Log. Comput., 1993

Defining Soft Sortedness by Abstract Interpretation.

Jian Chen, John Staples

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1992

Functional Verification of Hard Real-Time Programs.

Peter Kearney, John Staples, Abdu Abbas

Proceedings of the Algorithms, Software, Architecture, 1992

Soft Sorting in Logic Programming.

Jian Chen, John Staples

Proceedings of the ALPUK92, Proceedings of the 4th UK Conference on Logic Programming, London, 30 March, 1992

1991

An Extensional Fixed-Point Semantics for Nondeterministic Data Flow.

Peter Kearney, John Staples

Theor. Comput. Sci., 1991

Higher Level Meta Programming in Qu-Prolog 3: 0.

Anthony S. K. Cheng, Peter J. Robinson, John Staples

Proceedings of the Logic Programming, 1991

1990

Structure Sharing for Quantified Terms: Fundamentals.

John Staples, Peter J. Robinson

J. Autom. Reason., 1990

1988

Delaying Unification Algorithms for Lambda Calculi.

John Staples

Theor. Comput. Sci., 1988

Efficient Unification of Quantified Terms.

John Staples, Peter J. Robinson

J. Log. Program., 1988

Qu-Prolog: An Extended Prolog for Meta Level Programming.

John Staples, Peter J. Robinson, R. A. Paterson, R. A. Hagen, A. J. Craddock, P. C. Wallis

Proceedings of the Meta-Programming in Logic Programming, 1988

1986

Unification of quantified terms.

John Staples, Peter J. Robinson

Proceedings of the Graph Reduction, Proceedings of a Workshop, Santa Fé, New Mexico, USA, September 29, 1986

1985

A Fixpoint Semantics for Nondeterministic Data Flow

John Staples, V. L. Nguyen

J. ACM, April, 1985

1983

Computing the Behaviour of Asynchronous Processes.

John Staples, V. L. Nguyen

Theor. Comput. Sci., 1983

1982

The Maximum Flow Problem is Log Space Complete for P.

Leslie M. Goldschlager, Ralph A. Shaw, John Staples

Theor. Comput. Sci., 1982

Two-level expression representation for faster evaluation.

John Staples

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

Church-Rosser properties for graph replacement systems with unique splitting.

Hartmut Ehrig, John Staples

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

1981

Efficient Combinatory Reduction.

John Staples

Math. Log. Q., 1981

On Optimal Trees.

Peter Eades, John Staples

J. Algorithms, 1981

1980

Speeding up Subtree Replacement Systems.

John Staples

Theor. Comput. Sci., 1980

Optimal Evaluations of Graph-Like Expressions.

John Staples

Theor. Comput. Sci., 1980

Computation on Graph-Like Expressions.

John Staples

Theor. Comput. Sci., 1980

1978

Truth in constructive metamathematics.

John Staples

Notre Dame J. Formal Log., 1978

A Graph-Like Lambda Calculus for Which Leftmost-Overmost Reduction is Optimal.

John Staples

Proceedings of the Graph-Grammars and Their Application to Computer Science and Biology, 1978

1974

Combinator Realizability of a Constructive Morse Set Theory.

John Staples

J. Symb. Log., 1974