4767 search results - page 90 / 954 » Structures for Abstract Rewriting |
RTA
2010
Springer
14 years 1 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
BIRTHDAY
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
GPCE
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We describe our efforts to use source-level rewriting to optimize run-time program generators written in Jumbo, a run-time program generation system for Java. Jumbo is a...
ASPDAC
2009
ACM
14 years 2 months ago
2009
ACM
— This paper proposes the first automatic approach to simultaneously generate Cycle Accurate and Cycle Count Accurate transaction level bus models. Since TLM (Transaction Level M...
POPL
2000
ACM
14 years 2 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...