Author:
Ulidowski Irek,Yuen Shoji
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference41 articles.
1. L. Aceto, Deriving complete inference systems for a class of GSOS languages generating regular behaviours, in: B. Jonsson, J. Parrow (Eds.), Proceedings of the 5th International Conference on Concurrency Theory CONCUR’94, vol. 836, LNCS, Springer, 1994, pp. 449–464 (also, an unpublished full version).
2. Turning SOS rules into equations;Aceto;Information and Computation,1994
3. Structured operational semantics;Aceto,2001
4. Termination of term rewriting using dependency pairs;Arts;Theoretical Computer Science,2000
5. Term Rewriting and All That;Baader,1998
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献