The STUDIA UNIVERSITATIS BABEŞ-BOLYAI issue article summary

The summary of the selected article appears at the bottom of the page. In order to get back to the contents of the issue this article belongs to you have to access the link from the title. In order to see all the articles of the archive which have as author/co-author one of the authors mentioned below, you have to access the link from the author's name.

  
       
         
    STUDIA INFORMATICA - Issue no. 2 / 2000  
         
  Article:   TERM REWRITING SYSTEMS IN LOGIC PROGRAMMING AND IN FUNCŢIONAL PROGRAMMING.

Authors:  DOINA TĂTAR, GABRIELA ŞERBAN. 		 
       
         
  Abstract:  Automated theorem proving and term rewriting system are fields with big interest since some years. Often these fields have a common devel- opment. Is it not amazingly that logic programming and funcţional program- ming, which belongs to both these fields, offers simple solutions to problems arising at the frontier of them. In [8], the author submitted a challenge for "finding an optimum way to implement the rewriting systems ". This paper presents the way in that the logic programming and funcţional programming offer their concision to realize a sound implementation of the TRS.  
         
     
         
         
      Back to previous page