282 search results - page 51 / 57 » Propositional Fusion Rules |
ENTCS
2008
13 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
JAPLL
2008
13 years 7 months ago
2008
In traditional mathematical models of argumentation an argument often consists of a chain of rules or reasons, beginning with premisses and leading to a conclusion that is endorse...
JOLLI
2006
13 years 7 months ago
2006
Abstract. In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce ...
MICS
2010
13 years 5 months ago
2010
Strategies specify how a wide range of exercises can be solved incrementally, such as bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating wit...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Types play an important role both in reasoning about Haskell and for its implementation. For example, the Glasgow Haskell Compiler performs certain fusion transformations that are...