498 search results - page 40 / 100 » Term Rewriting |
ACL
2011
14 years 3 months ago
2011
We study the problem of finding the best headdriven parsing strategy for Linear ContextFree Rewriting System productions. A headdriven strategy must begin with a specified right...
RTA
2007
Springer
15 years 6 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...
ENTCS
2007
14 years 11 months ago
2007
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising fro...
125
click to vote
FLOPS
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We present the meta-theory behind the code generation facilities of Isabelle/HOL. To bridge the gap between the source (higherorder logic with type classes) and the many ...
135
click to vote
MST
2006
14 years 11 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...