TERSE: A visual environment for supporting analysis, verification and transformation of term rewriting systems

1. Huet, G., “Confluent Reductions:Abstract Properties and Applications to Term Rewriting Systems”, J.ACM, Vol.27, No.4, pp797–821 (1980).

   Google Scholar 

2. Dershowitz, N., “Termination of Rewriting”, J. Symbolic Computation, Vol.3, pp69–116 (1989).

   Google Scholar 

3. Matthews,B.: MERILL: An Equational Reasoning System in Standard ML, Rewriting Techniques and Applications, Lecture Notes in Computer Science, No. 690, pp. 441–445(1993).

   Google Scholar 

4. Bundgen,R., Reduce the Redex → ReDuX, Rewriting Techniques and Applications, Lecture Notes in Computer Science, No. 690, pp. 446–450(1993).

   Google Scholar 

5. Reppy,J.H., “CML: A higer-order concurrent language”, In Proceedings of the ACM SIGPLAN'91 on PLDI, pp293–305 (1991).

   Google Scholar 

6. Reppy,J.H., Gansner,E.R., “The eXene Library Manual(Version 0.4)”, AT&T Bell Laboratories (1993).

   Google Scholar 

7. Kawaguchi,N., Sakabe,T. and Inagaki,Y., “TERSE: TErm Rewriting Support Environment”, Proceedings of the 1994 ACM. SIGPLAN Workshop on Standard ML and its Applications, pp91–100 (1994).

   Google Scholar 

8. Kawaguchi,N., Sakabe,T. and Inagaki,Y.,“Visual Support Methods for Analysis, Verification and Transformation of Term Rewriting Systems”, ISSST Computer Software, Vol.13, No. 1, pp.23–36 (1996). (In Japanese)

   Google Scholar 

Download references