| S. Manchanda. Higher-order" logic as a data model. In Proc. of 2nd International. Workshop on Data Base Programming Languages, pages 330-341, June 1989. |
....superclass object as well as a subclass of instances below it in the object hierarchy. This mirrors a standard trick in mathematical logic [10] which is adopted here in order to provide a rst order semantics for a language which is syntactically higher order. Models such as Higher Order logic [19] and (earlier) F logic [16] follow a similar approach. We now de ne the interpretation functions of S. The function I d interprets each symbol in L as follows I d associates each object id i in I o with a unique object in D. I d maps each constant c to an element of D. Each symbol r ....
S. Manchanda. Higher-order" logic as a data model. In Proc. of 2nd International. Workshop on Data Base Programming Languages, pages 330-341, June 1989.
....superclass object as well as a subclass of instances below it in the object hierarchy. This mirrors a standard trick in mathematical logic [31] which is adopted here in order to provide a first order semantics for a language which is syntactically higher order. Models such as Higher Order logic [57] and (earlier) F logic [47] follow a similar approach. We now define the interpretation functions of S. The function I d interprets each symbol in L as follows 7 : ffl I d associates each object id i in IO with a unique object in O. ffl I d maps each constant c of sort in C to an element ....
S. Manchanda. Higher-order" logic as a data model. In Proc. of 2nd International. Workshop on Data Base Programming Languages, pages 330--341, June 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