Lines Matching refs:system

73   a general-purpose term-rewriting base. Covers the type system (typed
98 section](#core-isle-a-term-rewriting-system).*
101 system](https://en.wikipedia.org/wiki/Rewriting#Term_rewriting_systems),
102 or TRS, is a system that works by representing data as *terms* and
107 is the system's output.
109 Term-rewriting systems are a general kind of computing system, at the
117       introduced by Alonzo Church is actually a term-rewriting system
138 latter (the "strategy") at will without breaking the system's
156 A term-rewriting system typically operates on data that is in a *tree*
229 The heart of a term-rewriting system is in the set of *rules* that
276 A fully-featured term rewriting system usually has other operators as
303 However, in order to provide a deterministic answer, the system must
333 desired. A typical term-rewrite system allows just a few options in
348 the top-level execution of a term-rewriting system proceeds. Much of
426 application of a term-rewriting system should not depend for
457 term-rewriting system, with a design that very closely follows the
462 term-rewriting system, especially one designed for instruction
469 in the type system ("load that I can sink", "instruction that produces
550 Note that the system allows multiple applicable rules to exist with
551 the same priority: that is, while the priority system allows for
554 Finally, one important note: the priority system is considered part of
627 type" is somewhat foreign to a classical term-rewriting system. In
640 have some caution. In most applications of a term-rewriting system,
720 We should illuminate one particular aspect of the ISLE type system
740 This gets to the heart of rewrite-system-based computation, and has
816 term-rewriting system operates on a term data-structure that exists in
818 at a particular point in the input, an extractor-based system instead
1163 a fairly standard term-rewriting system, on the boundaries the "terms"