Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract)

Authors:
Satoshi Okui;Aart Middeldorp;Tetsuo Ida
Affiliations:
-;-;-
Venue:
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Year:
1995

Citing 0
Cited 3

Functional and constraint logic programming

Constraints in computational logics
Complete symbolic reachability analysis using back-and-forth narrowing

Theoretical Computer Science - Algebra and coalgebra in computer science
Complete symbolic reachability analysis using back-and-forth narrowing

CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract