Sciweavers

367 search results - page 19 / 74
» A Rewriting Logic Sampler
Sort
View
CC
2001
Springer
177views System Software» more  CC 2001»
14 years 15 days ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor
WRLA
2010
13 years 6 months ago
The Third Rewrite Engines Competition
This paper presents the main results and conclusions of the Third Rewrite Engines Competition (REC III). This edition of the competition took place as part of the 8th Workshop on R...
Francisco Durán, Manuel Roldán, Jean...
CADE
2003
Springer
14 years 8 months ago
Proof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
Eric Deplagne, Claude Kirchner, Hélè...
ECEASST
2008
82views more  ECEASST 2008»
13 years 8 months ago
Interaction nets: programming language design and implementation
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
Abubakar Hassan, Ian Mackie, Shinya Sato
JAR
2010
95views more  JAR 2010»
13 years 2 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney