Sciweavers

234 search results - page 14 / 47
» Deduction, Strategies, and Rewriting
Sort
View
TLCA
2007
Springer
15 years 6 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
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...
Denis Cousineau 0002, Gilles Dowek
ENTCS
2002
98views more  ENTCS 2002»
14 years 11 months ago
Building Interpreters with Rewriting Strategies
Eelco Dolstra, Eelco Visser
ICLP
2009
Springer
16 years 14 days ago
Demand-Driven Normalisation for ACD Term Rewriting
ACD Term Rewriting (ACDTR) is term rewriting modulo associativity, commutativity, and a limited form of distributivity called conjunctive context. Previous work presented an implem...
Leslie De Koninck, Gregory J. Duck, Peter J. Stuck...