Preface: Theoretical Computer Science in Australia and New Zealand | 0 | 0.34 | 1996 |
Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings | 48 | 5.11 | 1995 |
Theorem Proving Applications for QU-Prolog. | 0 | 0.34 | 1994 |
Formalizing a Hierarchical Structure of Practical Mathematical Reasoning | 32 | 3.43 | 1993 |
Defining Soft Sortedness by Abstract Interpretation | 0 | 0.34 | 1993 |
Soft Sorting in Logic Programming | 2 | 0.46 | 1992 |
Functional Verification of Hard Real-Time Programs | 2 | 0.67 | 1992 |
Higher Level Meta Programming In Qu-Prolog 3.0 | 3 | 0.68 | 1991 |
Two-level expression representation for faster evaluation | 2 | 3.87 | 1982 |
Efficient Combinatory Reduction | 1 | 0.56 | 1981 |
Speeding Up Subtree Replacement Systems | 7 | 5.31 | 1980 |
Truth in constructive metamathematics. | 0 | 0.34 | 1978 |
A Graph-Like Lambda Calculus for Which Leftmost-Overmost Reduction is Optimal | 6 | 0.83 | 1978 |
Combinator Realizability of a Constructive Morse Set Theory | 0 | 0.34 | 1974 |