I. Rewitzky and C. Brink. Predicate transformers as power operations. Formal Aspects of Computing 7 (2) (1995) p 169--182.  Home/Search   Document Not in Database   Summary   Related Articles

....simplest possible languages. However their value lies in providing an approach for establishing soundness and completeness of simulations from that of simpler simulations. We use J onsson Tarski duality [9] based on Stone s representation theorem [14] to effect a translation (similar to that in [13]) between the relational [11, 8] and predicate transformer [3] semantics of data types and simulation rules. This automatically provides a reformulation of the explanation in [3] of why in the relational model two kinds of simulation rule are necessary to establish completeness while in the ....

....by x and y. Applying this translation to each predicate transformer of PA, we obtain its ultrafilter data type PA # . Together with Stone s result, these translations yield a bijective correspondence between relational and predicate transformer data types. The proof is similar to that in [13]. Theorem 4.1 Any relational data type is isomorphic to the principal ultrafilter data type of its power operator transformer data type. Dually, any predicate transformer data type is isomorphic to the power operator data type of its principal ultrafilter data type. Corollary 4.2 For conformal A ....

I. Rewitzky and C. Brink. Predicate transformers as power operations. Formal Aspects of Computing 7 (2) (1995) p 169--182.

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