368 search results - page 22 / 74 » Arithmetic as a Theory Modulo |
WRLA
2010
13 years 7 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
ASAP
2000
IEEE
14 years 10 days ago
2000
IEEE
Exploiting instruction-level parallelism (ILP) is extremely important for achieving high performance in application specific instruction set processors (ASIPs) and embedded proces...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
CONCUR
2005
Springer
14 years 2 months ago
2005
Springer
Usually, ranking function synthesis and invariant generation oop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic...