Abstract
If a strong monad M is used to define the denotational semantics of a functional language with computations, a product operation x : MX × MY → M ( X × Y) is needed to define the semantics of pairing. Every strong monad is equipped with two standard products, which correspond to left-to-right and right-to-left evaluation. We study the algebraic properties of these standard products in general. Then we define alternative products with similar properties for strict and parallel evaluation in the special case of strong monads in DCPO which are obtained as free constructions w.r.t. various theories of non-deterministic computation, including both classical and probabilistic theories.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
