Atsushi Ohori. A compilation method for ML-style polymor- phlc record calculi. In Nineteenth Annual ACM Syrup. on Principles of Prog. Languages, New York, Jan 1992. ACM Press.  Home/Search   Document Not in Database   Summary   Related Articles

....tax) ml) else ( m m, m) Figure 4: Kinded unification algorithm imum sharing constraints required to make the structure expression elaborate. Figure 4 gives the unification algorithms KindUnify ad Name Unify. The kinded unification algorithm KindUnify presented there extends the one in Ohori [24] with considerations on ML structure names. The following theorem can be proved in the same way as Ohori [24] Theorem 3.1 Given any kinded set of equations, the algorithm KindUnify computes a most general unifier if one exists and reports failure otherwise. The following lemma shows how the ....

....the structure expression elaborate. Figure 4 gives the unification algorithms KindUnify ad Name Unify. The kinded unification algorithm KindUnify presented there extends the one in Ohori [24] with considerations on ML structure names. The following theorem can be proved in the same way as Ohori [24]. Theorem 3.1 Given any kinded set of equations, the algorithm KindUnify computes a most general unifier if one exists and reports failure otherwise. The following lemma shows how the thinning effect is achieved in our algorithm. Lemma 3.2 Given a signature E = N(S) and a structure S , ....

Atsushi Ohori. A compilation method for ML-style polymor- phlc record calculi. In Nineteenth Annual ACM Syrup. on Principles of Prog. Languages, New York, Jan 1992. ACM Press.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC