| Birgit Schieder and Manfred Broy. Adapting calculational logic to the undefined. The Computer Journal, 5(2):73--81, February 1999. |
.... E if E s type is Collection 1 E 2 , x] 1 E 2 , x] all other patterns Figure 3.9: Translating the universal quantifier. 3.4. 1 Undefinedness The undefinedness problem has been studied by many researchers in the framework of logics (e.g. 67] 121] [137]) The reason is that programming abounds with partial functions, and if partial functions are admitted in logical formulae, a programming logic is needed that handles partial functions and undefined expressions [137] Two valued logics with undefined handles partial functions by introducing a ....
.... has been studied by many researchers in the framework of logics (e.g. 67] 121] 137] The reason is that programming abounds with partial functions, and if partial functions are admitted in logical formulae, a programming logic is needed that handles partial functions and undefined expressions [137]. Two valued logics with undefined handles partial functions by introducing a constant (e.g. #) to represent an undefined value [122] Three valued logics with undefined allows the logical formulae to have the undefined value [11] 14] 68] 79] Some logics introduce even more than one ....
Birgit Schieder and Manfred Broy. Adapting calculational logic to the undefined. The Computer Journal, 5(2):73--81, February 1999.
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