Design and implementation of parallel TRAM

Workshop 19: Symbolic Computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1300)


Local Strategy Garbage Collection Fibonacci Number Subject Term Matching Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Aït-Kaci, H.: Warren's Abstract Machine. A Tutorial Reconstruction. The MIT Press. 1991Google Scholar
  2. 2.
    CafeOBJ home page: Scholar
  3. 3.
    Christian, J.: Flatterms, Discrimination Nets, and Fast Term Rewriting. Journal of Automated Reasoning. 10 (1993) 95–113MathSciNetCrossRefGoogle Scholar
  4. 4.
    Goguen, J., Kirchner, C. and Meseguer, J.: Concurrent Term Rewriting as a Model of Computation. Proc. of the Workshop on Graph Reduction. LNCS 279 Springer-Verlag. (1986) 53–93Google Scholar
  5. 5.
    Kirchner, C., Kirchner, H. and Meseguer, J.: Operational Semantics of OBJ-3. Proc. of the 15th International Colloquium on Automata, Languages and Programming. LNCS 317 Springer-Verlag. (1988) 287–301Google Scholar
  6. 6.
    Futatsugi, K., Goguen, J. A., Jouannaud, J. P. and Meseguer, J.: Principles of OBJ2. Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages. (1984) 52–66Google Scholar
  7. 7.
    Ogata, K., Ohhara, K. and Futatsugi, K.: TRAM: An Abstract Machine for Order-Sorted Conditional Term Rewriting Systems. Proc. of the 8th International Conference on Rewriting Techniques and Applications. (1997) (to appear)Google Scholar
  8. 8.
    Viry, P. and Kirchner, C.: Implementing Parallel Rewriting. Proc. of the International Workshop on Programming Language Implementation and Logic Programming. LNCS 456 Springer-Verlag. (1990) 1–15 *** DIRECT SUPPORT *** A0008C42 00042Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  1. 1.JAISTJapan

Personalised recommendations