67 search results - page 4 / 14 » A Theorem on Higher Bruhat Orders |
WADT
1999
Springer
13 years 11 months ago
1999
Springer
CADE
1998
Springer
13 years 11 months ago
1998
Springer
PPCP
1993
13 years 11 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
ACL
1996
13 years 8 months ago
1996
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...