Searching for authors named Lee Naish – sorted by Relevance.
-
Approximating the Success Set of Logic Programs Using Constrained Regular Types
- Approximating the success set of logic programs using regular types Lee Naish Department
- Add To MetaCart
-
Coroutining and the Construction of Terminating Logic Programs
- Coroutining and the construction of terminating logic programs Lee Naish (lee
- Cited by 21 (1 self) – Add To MetaCart
-
Pruning in Logic Programming
- Pruning in logic programming Lee Naish (lee@(email omitted);, http://www.cs.mu.oz.au/~lee) Technical
- Cited by 9 (0 self) – Add To MetaCart
-
Mode Checking Using Constrained Regular Trees
- Mode checking using constrained regular trees Lee Naish (lee@(email omitted);, http://www.cs.mu.oz.au/~lee
- Cited by 2 (0 self) – Add To MetaCart
-
A Declarative View of Modes
- A declarative view of modes Lee Naish (lee@(email omitted);, http://www.cs.mu.oz.au/~lee) Technical
- Cited by 12 (4 self) – Add To MetaCart
-
A three-valued semantics for Horn clause programs
- A three-valued semantics for Horn clause programs Lee Naish (lee@(email omitted);, http://www.cs.mu.oz.au/~lee
- Cited by 6 (1 self) – Add To MetaCart
-
Verification of Logic Programs and Imperative Programs
- Verification of logic programs and imperative programs Lee Naish Technical Report 90/6 (Revised May
- Cited by 6 (1 self) – Add To MetaCart
-
Declarative Debugging of Lazy Functional Programs
- Declarative debugging of lazy functional programs Lee Naish (lee@(email omitted);) Technical Report 92
- Cited by 14 (3 self) – Add To MetaCart
-
Adding equations to NU-Prolog
- Adding equations to NU-Prolog Lee Naish (lee@(email omitted);) Technical Report 91/2 Department
- Cited by 33 (5 self) – Add To MetaCart
-
Higher-order logic programming in Prolog
- Multi-Paradigm Logic Programming Higher-order logic programming in Prolog Lee Naish, University
- Cited by 6 (0 self) – Add To MetaCart

