The following pages link to (Q4692880):
Displaying 22 items.
- Semantics and strong sequentially of priority term rewriting systems (Q5055874) (← links)
- Getting There and Back Again (Q5074057) (← links)
- Critical pairs in term graph rewriting (Q5096914) (← links)
- (Q5119396) (← links)
- Recursive Functions with Pattern Matching in Interaction Nets (Q5170281) (← links)
- Complexity of Fractran and Productivity (Q5191114) (← links)
- Adaptive pattern matching (Q5204321) (← links)
- Lazy Lambda calculus: Theories, models and local structure characterization (Q5204341) (← links)
- Efficiency of lambda-encodings in total type theory (Q5371961) (← links)
- (Q5856410) (← links)
- Explicit cyclic substitutions (Q5881174) (← links)
- Simple type inference for term graph rewriting systems (Q5881175) (← links)
- Compiling concurrent rewriting onto the Rewrite Rule Machine (Q5881288) (← links)
- A chemical abstract machine for graph reduction extended abstract (Q5890053) (← links)
- Pattern matching compilation of functions defined in context-free languages (Q5945841) (← links)
- A correct-by-construction conversion from lambda calculus to combinatory logic (Q6065511) (← links)
- Machine Deduction (Q6083700) (← links)
- Node Replication: Theory And Practice (Q6192004) (← links)
- Retrieving library identifiers via equational matching of types (Q6488563) (← links)
- A new proposal of concurrent process calculus (Q6560193) (← links)
- Fundamentals of context-sensitive rewriting (Q6573934) (← links)
- Disproving termination of non-erasing sole combinatory calculus with tree automata (Q6666803) (← links)
