Chuck C. Liang

Learn More
Meta-programming in logic has had diiculty with a class of problems, which includes polymorphic type inferencing and Knuth-Bendix completion. At the core of this diiculty is that logic programming, in particular higher-order logic programming, is often too dependent on its inherent uniication and resolution algorithms in providing declarative formulations(More)
  • 1