On the longest perpetual reductions in orthogonal expression reduction systems
Theoretical Computer Science
Theoretical Computer Science - Special issue on theories of types and proofs
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Confluence and Termination of Simply Typed Term Rewriting Systems
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
An initial algebra approach to term rewriting systems with variable binders
Higher-Order and Symbolic Computation
Higher-order semantic labelling for inductive datatype systems
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
The Computability Path Ordering: The End of a Quest
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Universal algebra for termination of higher-order rewriting
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Semantic labelling for proving termination of combinatory reduction systems
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Computability closure: ten years later
Rewriting Computation and Proof
Hi-index | 0.00 |