Papaspyrou, N. S., A resumption monad transformer and its applications in the semantics of concurrency, in: Proc. 3rd Panhellenic Logic Symposium, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Monadic Semantics for Core Curry - Tolmach, Antoy (2003) (1 citation) (Correct)
....The conc operator non deterministically tries both orders for evaluating its arguments at each stage of partial computation. As before, support for non determinism is given by monad A (which does not change) A proof that this version of M actually obeys the monad laws is given by Papaspyrou [15]. 5 Conclusion and Future Work We have presented a simple executable semantics for the core of Curry. The full code for the three interpreter versions described here is available at http: www.cs.pdx.edu apt curry monads. The structure of our semantics sheds some light on how the basic ....
Papaspyrou, N. S., A resumption monad transformer and its applications in the semantics of concurrency, in: Proc. 3rd Panhellenic Logic Symposium, 2001.
A Resumption Monad Transformer and its Applications in the.. - Papaspyrou (2001) (1 citation) Self-citation (Papaspyrou) (Correct)
....5. 2 Mathematical background In this section we define part of the mathematical background that is necessary for the rest of the paper. We introduce monads and monad transformers and discuss their connection with computations and the semantics of programming languages. The reader is referred to [Papa01] for a more complete and informative introduction, and to the literature related to category theory [Pier91, Aspe91, Barr96] and domain theory [Scot82, Gunt90] 2.1 Monads and monad transformers The notion of monad, also called triple, is not new in the context of category theory. In Computer ....
....isomorphism by constructing the two components of the isomorphism. Finally, in Section 3.5 we define a few additional operations on domains constructed by R(M) Most proofs of the results contained in this section have been omitted due to space restrictions. The reader is referred to [Papa01] for more details. 3.1 Functor RM We start by defining for each domain D an endofunctor FM;D : Dom Dom, and some auxiliary functions. The domain R(M) D) that we are trying to define is a fixed point of FM;D . Definition 3.1 Let D, A and B be domains and f : A B a continuous function. We ....
[Article contains additional citation context not shown here]
N. S. Papaspyrou, "A Resumption Monad Transformer and its Applications in the Semantics of Concurrency", Technical Report CSD-SW-TR-2-01, National Technical University of Athens, Software Engineering Laboratory, April 2001.
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