Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Under consideration for publication in Math. Struct. in Comp. Science ##closed relations and admissibility
 

Summary: Under consideration for publication in Math. Struct. in Comp. Science
##­closed relations and admissibility
Mart’n Abadi +
Bell Labs Research, Lucent Technologies
3180 Porter Drive, Palo Alto, California 94304, USA
Received 11 October 1999
While developing a method for reasoning about programs, Pitts defined the ##­closed
relations as an alternative to the standard admissible relations. This paper reformulates
and studies Pitts's operational concept of ##­closure in a semantic framework. It
investigates the nontrivial connection between ##­closure and admissibility, showing
that ##­closure is strictly stronger than admissibility and that every ##­closed relation
corresponds to an admissible preorder.
1. Introduction
Reynolds's analysis of parametric polymorphism is based on relations and constructions
on relations (Reynolds 1983). Wadler and others have shown how this analysis yields
proof principles for polymorphic programs (Wadler 1989; Mairson 1991; Abadi et al.
1993; Plotkin and Abadi 1993; Plotkin 1993). Although Reynolds allowed a large class
of relations in his work, restrictions are essential for soundness in languages with re­
cursion. A common restriction is to consider only the admissible relations. (The next
section reviews the definition of admissibility.) For example, Wadler suggested that the

  

Source: Abadi, Martín - Department of Computer Science, University of California at Santa Cruz

 

Collections: Computer Technologies and Information Sciences