Amy Felty and Dale Miller. A meta language for type checking and inference: An extended abstract. Presented at the 1989 Workshop on Programming Logic, Balstad, Sweden, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....specifying a particular logic would serve as a parameter to such a specification. Such an approach adds one level of indirection in implementing object logics since now each (BACKCHAIN) step corresponds to the application of an LF rule. This approach to implementing typed calculi is taken in [8], where it is also shown that it can be applied to systems with quantification over types. Such an approach requires an encoding of terms at all levels of the calculus being specified. In LF, for instance, meta level constants for the various notions of application and abstraction must be ....

Amy Felty and Dale Miller. A meta language for type checking and inference: An extended abstract. Presented at the 1989 Workshop on Programming Logic, Balstad, Sweden, 1989.

....over types is permitted. Despite this fact, it would be interesting to study ways in which CC could be adopted as a meta language for rewriting. It is also possible to encode terms of CC in the simply typed calculus, and to specify and implement provability for this calculus in hh [9]. Using this encoding, notions of convertibility of CC terms could be expressed as higher order rewrite systems as defined here, and incorporated into such an implementation. Another direction of study in higher order rewriting has been to consider the interaction of first order rewrite systems ....

Amy Felty and Dale Miller. A meta language for type checking and inference: An extended abstract. Presented at the 1989 Workshop on Programming Logic, Balstad, Sweden, 1989.

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