1458 search results - page 13 / 292 » Extended Term Rewriting Systems |
IEICET
2007
13 years 7 months ago
2007
The completeness (i.e. confluent and terminating) property is an important concept when using a term rewriting system (TRS) as a computational model of functional programming lang...
CAINE
2001
13 years 8 months ago
2001
In this paper, we describe the theoretical framework that allows us to use of the expert system shell CLIPS to define the network model in the Distribution Management System (DMS)...
PPDP
2004
Springer
14 years 21 days ago
2004
Springer
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
FLOPS
2010
Springer
14 years 2 months ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
FOSSACS
2001
Springer
13 years 12 months ago
2001
Springer
The rewriting calculus, or Rho Calculus (ρCal), is a simple calculus that uniformly integrates abstraction on patterns and nondeterminism. Therefore, it fully integrates rewriting...