226 search results - page 5 / 46 » Extensional Theories and Rewriting |
105
Voted
PPDP
2004
Springer
15 years 5 months ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
110
click to vote
FROCOS
2009
Springer
15 years 7 months ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
96
Voted
AMAST
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...
103
click to vote
FLOPS
2008
Springer
15 years 2 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
97
Voted
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...