Relating conflict-free stable transition and event models via redex families
Theoretical Computer Science
Normalisation in Weakly Orthogonal Rewriting
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Reductions, intersection types, and explicit substitutions
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Stable computational semantics of conflict-free rewrite systems (partial orders with duplication)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Axiomatic rewriting theory i: a diagrammatic standardization theorem
Processes, Terms and Cycles
Call-by-Value solvability, revisited
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
| Hi-index | 0.00 |