Sciweavers

4767 search results - page 18 / 954
» Structures for Abstract Rewriting
Sort
View
MCMASTER
1993
13 years 11 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
JSAI
2007
Springer
14 years 1 months ago
Inverse Scope as Metalinguistic Quotation in Operational Semantics
We model semantic interpretation operationally: constituents interact as their combination in discourse evolves from state to state. The states are recursive data structures and ev...
Chung-chieh Shan
ACL
1996
13 years 8 months ago
Efficient Transformation-Based Parsing
In transformation-based parsing, a finite sequence of tree rewriting rules are checked for application to an input structure. Since in practice only a small percentage of rules ar...
Giorgio Satta, Eric Brill
TPHOL
2005
IEEE
14 years 1 months ago
Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof
We discuss methods for dealing effectively with let-bindings in proofs. Our contribution is a small set of unconditional rewrite rules, found by the bracket abstraction translatio...
Michael Norrish, Konrad Slind
FOSSACS
2001
Springer
13 years 12 months ago
The Rho Cube
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori