234 search results - page 14 / 47 » Deduction, Strategies, and Rewriting |
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
RTA
2001
Springer
14 years 1 days ago
2001
Springer
DCAI
2008
13 years 9 months ago
2008
ENTCS
2002
13 years 7 months ago
2002
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...