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 / 1999  
         
  Article:   F-BOUNDED QUANTIFICATION AND THE MATCHING RELATION.

Authors:  SIMONA MOTOGNA. 		 
       
         
  Abstract:  The introduction of F-bounded polymorphism had proved to have great benefīts in specifīcation of object oriented languages, and the most important one, concerning binary methods and recursion defīnition, is also presented here. Then many other systems had appeared, such as PolyTOIL, based on the matching relation, and we prove that F-bounded quantification and the matching relation are equivalent.  
         
     
         
         
      Back to previous page