John Staples - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

1996

1995

Soft Typing of General First-Order LanguagesH. Becht, John Staples. apsec 1995: 480-488 [doi]

1994

Theorem Proving Applications for QU-PrologPeter J. Robinson, John Staples, Anthony S. K. Cheng. ICLP 1994:

A Functional Logic for Higher Level Reasoning About ComputationJohn Staples, Peter J. Robinson, Daniel Hazel. fac, 6(1):1-38, 1994.

1993

Defining Soft Sortedness by Abstract InterpretationJian Chen, John Staples. mfcs 1993: 362-371

Formalizing a Hierarchical Structure of Practical Mathematical ReasoningPeter J. Robinson, John Staples. logcom, 3(1):47-61, 1993.

1992

Soft Sorting in Logic ProgrammingJian Chen, John Staples. alpuk 1992: 79-96

Functional Verification of Hard Real-Time ProgramsPeter Kearney, John Staples, A. Abbas. ifip 1992: 113-119

1991

Higher Level Meta Programming in Qu-Prolog 3: 0Anthony S. K. Cheng, Peter J. Robinson, John Staples. ICLP 1991: 285-298

An Extensional Fixed-Point Semantics for Nondeterministic Data FlowPeter Kearney, John Staples. TCS, 91(2):129-179, 1991.

1990

Structure Sharing for Quantified Terms: FundamentalsJohn Staples, Peter J. Robinson. JAR, 6(2):115-145, 1990.

1988

Qu-Prolog: An Extended Prolog for Meta Level ProgrammingJohn Staples, Peter J. Robinson, R. A. Paterson, R. A. Hagen, A. J. Craddock, P. C. Wallis. meta 1988: 435-452

Efficient Unification of Quantified TermsJohn Staples, Peter J. Robinson. jlp, 5(2):133-149, 1988.

Delaying Unification Algorithms for Lambda CalculiJohn Staples. TCS, 56:277-288, 1988.

1986

Unification of quantified termsJohn Staples, Peter J. Robinson. gr 1987: 426-450

1985

A Fixpoint Semantics for Nondeterministic Data FlowJohn Staples, V. L. Nguyen. JACM, 32(2):411-444, April 1985. [doi]

1983

Computing the Behaviour of Asynchronous ProcessesJohn Staples, V. L. Nguyen. TCS, 26:343-353, 1983.

1982

Church-Rosser properties for graph replacement systems with unique splittingHartmut Ehrig, John Staples. gg 1983: 82-101

The Maximum Flow Problem is Log Space Complete for PLeslie M. Goldschlager, Ralph A. Shaw, John Staples. TCS, 21:105-111, 1982.

Two-level expression representation for faster evaluationJohn Staples. gg 1983: 392-404

1981

On Optimal TreesPeter Eades, John Staples. jal, 2(4):369-384, 1981.

Efficient Combinatory ReductionJohn Staples. mlq, 27(25-30):391-402, 1981. [doi]

1980

Speeding up Subtree Replacement SystemsJohn Staples. TCS, 11:39-47, 1980.

Optimal Evaluations of Graph-Like ExpressionsJohn Staples. TCS, 10:297-316, 1980.

Computation on Graph-Like ExpressionsJohn Staples. TCS, 10:171-185, 1980.

1978

A Graph-Like Lambda Calculus for Which Leftmost-Overmost Reduction is OptimalJohn Staples. gg 1979: 440-455

Truth in constructive metamathematicsJohn Staples. ndjfl, 19(3):489-494, 1978. [doi]

1974

Combinator Realizability of a Constructive Morse Set TheoryJohn Staples. JSYML, 39(2):226-234, 1974.

Sign in or sign up to see more results.

runs on WebDSL