| S. Abramsky, D.M. Gabbay and T.S.E.Maibaum, (eds) Handbook of Logic in Computer Science vol 1-6, Oxford Science Publications, Clarendon Press, Oxford 1994. |
....the notation used, explaining the constructions required to model our programming language and drawing attention to some details of significance in later developments. For basic concepts and terminology of domain theory and category theory the reader is referred to any standard reference, e.g. [1]. We interpret mini Facile in the cartesian closed category of bounded complete algebraic dcpo s with continuous functions as morphisms. More precisely, the model is specified by a domain equation with parameters the discrete dcpo s of integers, booleans and the one element unit domain, to be ....
....union. As usual, fj Deltajg : D P Gamma (D) denotes the formal singleton (insertion of generators) continuous map. We use P H (D) to denote the lower (Hoare) powerdomain of D. Theorem 2. 2 If D is an algebraic dcpo, then D = Idl(K(D) and P H (D) Idl(Fin(K(D) Proof: See for example [1], vol. 3. A continuous function over domains f is linear provided f(d d 0 ) fd fd 0 . If f has more than one argument, for example f : D Theta D 0 E) then we say it is multilinear if it is linear in each of its arguments. We will often use the following fact. Theorem 2.3 Let D, E be ....
S. Abramsky, D.M. Gabbay and T.S.E.Maibaum, (eds) Handbook of Logic in Computer Science vol 1-6, Oxford Science Publications, Clarendon Press, Oxford 1994.
No context found.
S. Abramsky, D.M. Gabbay and T.S.E.Maibaum, (eds) Handbook of Logic in Computer Science vol 1-6, Oxford Science Publications, Clarendon Press, Oxford 1994.
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