Sciweavers

1458 search results - page 28 / 292
» Extended Term Rewriting Systems
Sort
View
LREC
2008
150views Education» more  LREC 2008»
13 years 8 months ago
Automatic Translation of Biomedical Terms by Supervised Machine Learning
In this paper, we present a simple yet efficient automatic system to translate biomedical terms. It mainly relies on a machine learning approach able to infer rewriting rules from...
Vincent Claveau
POPL
1997
ACM
13 years 11 months ago
Call by Need Computations to Root-Stable Form
The following theorem of Huet and L
Aart Middeldorp
GG
2008
Springer
13 years 8 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
ERSHOV
1999
Springer
13 years 11 months ago
On Perfect Supercompilation
We extend positive supercompilation to handle negative as well as positive information. This is done by instrumenting the underlying unfold rules with a small rewrite system that h...
Jens P. Secher, Morten Heine Sørensen
ECEASST
2008
82views more  ECEASST 2008»
13 years 7 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