28
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      ELAN from a rewriting logic point of view

      , , ,
      Theoretical Computer Science
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references24

          • Record: found
          • Abstract: not found
          • Article: not found

          Conditional rewriting logic as a unified model of concurrency

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Constraint logic programming: a survey

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Complete Sets of Reductions for Some Equational Theories

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                August 2002
                August 2002
                : 285
                : 2
                : 155-185
                Article
                10.1016/S0304-3975(01)00358-9
                175d0202-7131-4f74-bb3e-d2737da75051
                © 2002

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article