default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Staples
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
[j17]C. Barry Jay, John Staples:
Preface: Theoretical Computer Science in Australia and New Zealand. Theor. Comput. Sci. 169(1): 1 (1996)- [c13]John Staples:
Verification, Validation and the Future of Software Engineering. Australian Software Engineering Conference 1996: 2 - [c12]Lin Zucconi, Greg Royle, Karl Reed, John Staples:
Do Formal Methods Really Work? Australian Software Engineering Conference 1996: 66- - 1995
- [c11]H. Becht, John Staples:
Soft Typing of General First-Order Languages. APSEC 1995: 480-488 - [e1]John Staples, Peter Eades, Naoki Katoh, Alistair Moffat:
Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings. Lecture Notes in Computer Science 1004, Springer 1995, ISBN 3-540-60573-8 [contents] - 1994
- [j16]John Staples, Peter J. Robinson, Daniel Hazel:
A Functional Logic for Higher Level Reasoning About Computation. Formal Aspects Comput. 6(1): 1-38 (1994) - [c10]Peter J. Robinson, John Staples, Anthony S. K. Cheng:
Theorem Proving Applications for QU-Prolog. ICLP Workshop: Proof-Theoretical Extensions on Logic Programming 1994 - 1993
- [j15]Peter J. Robinson, John Staples:
Formalizing a Hierarchical Structure of Practical Mathematical Reasoning. J. Log. Comput. 3(1): 47-61 (1993) - [c9]Jian Chen, John Staples:
Defining Soft Sortedness by Abstract Interpretation. MFCS 1993: 362-371 - 1992
- [c8]Jian Chen, John Staples:
Soft Sorting in Logic Programming. ALPUK 1992: 79-96 - [c7]Peter Kearney, John Staples, Abdu Abbas:
Functional Verification of Hard Real-Time Programs. IFIP Congress (1) 1992: 113-119 - 1991
- [j14]Peter Kearney, John Staples:
An Extensional Fixed-Point Semantics for Nondeterministic Data Flow. Theor. Comput. Sci. 91(2): 129-179 (1991) - [c6]Anthony S. K. Cheng, Peter J. Robinson, John Staples:
Higher Level Meta Programming in Qu-Prolog 3: 0. ICLP 1991: 285-298 - 1990
- [j13]John Staples, Peter J. Robinson:
Structure Sharing for Quantified Terms: Fundamentals. J. Autom. Reason. 6(2): 115-145 (1990)
1980 – 1989
- 1988
- [j12]John Staples, Peter J. Robinson:
Efficient Unification of Quantified Terms. J. Log. Program. 5(2): 133-149 (1988) - [j11]John Staples:
Delaying Unification Algorithms for Lambda Calculi. Theor. Comput. Sci. 56: 277-288 (1988) - [c5]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: 435-452 - 1986
- [c4]John Staples, Peter J. Robinson:
Unification of quantified terms. Graph Reduction 1986: 426-450 - 1985
- [j10]John Staples, V. L. Nguyen:
A Fixpoint Semantics for Nondeterministic Data Flow. J. ACM 32(2): 411-444 (1985) - 1983
- [j9]John Staples, V. L. Nguyen:
Computing the Behaviour of Asynchronous Processes. Theor. Comput. Sci. 26: 343-353 (1983) - 1982
- [j8]Leslie M. Goldschlager, Ralph A. Shaw, John Staples:
The Maximum Flow Problem is Log Space Complete for P. Theor. Comput. Sci. 21: 105-111 (1982) - [c3]Hartmut Ehrig, John Staples:
Church-Rosser properties for graph replacement systems with unique splitting. Graph-Grammars and Their Application to Computer Science 1982: 82-101 - [c2]John Staples:
Two-level expression representation for faster evaluation. Graph-Grammars and Their Application to Computer Science 1982: 392-404 - 1981
- [j7]Peter Eades, John Staples:
On Optimal Trees. J. Algorithms 2(4): 369-384 (1981) - [j6]John Staples:
Efficient Combinatory Reduction. Math. Log. Q. 27(25-30): 391-402 (1981) - 1980
- [j5]John Staples:
Computation on Graph-Like Expressions. Theor. Comput. Sci. 10: 171-185 (1980) - [j4]John Staples:
Optimal Evaluations of Graph-Like Expressions. Theor. Comput. Sci. 10: 297-316 (1980) - [j3]John Staples:
Speeding up Subtree Replacement Systems. Theor. Comput. Sci. 11: 39-47 (1980)
1970 – 1979
- 1978
- [j2]John Staples:
Truth in constructive metamathematics. Notre Dame J. Formal Log. 19(3): 489-494 (1978) - [c1]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: 440-455 - 1974
- [j1]John Staples:
Combinator Realizability of a Constructive Morse Set Theory. J. Symb. Log. 39(2): 226-234 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
