Identifying All Preorders on the Subdistribution Monad
نویسندگان
چکیده
منابع مشابه
All You Need is the Monad. . . What Monad Was That Again?
Probability enjoys a monadic structure (Lawvere 1962; Giry 1981; Ramsey and Pfeffer 2002). A monadic computation represents a probability distribution, and the unit operation return a creates the (Dirac) distribution “certainly a.” The bind operation combines a distribution of type M a and a function of type a -> M b; the function is a probability kernel (Pollard 2002), and it represents the co...
متن کاملPreorders on Monads and Coalgebraic Simulations
We study the construction of preorders on Set-monads by the semantic ⊤⊤-lifting. We show the universal property of this construction, and characterise the class of preorders on a monad as a limit of a Card-chain. We apply these theoretical results to identifying preorders on some concrete monads, including the powerset monad, maybe monad, and their composite monad. We also relate the constructi...
متن کاملOn Efficiency Preorders
Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences. Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity O(nm), compares favourably with that for deciding observational equivalence (O(nm...
متن کاملOn the Continuous Representation of Preorders
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...
متن کاملModular Compilers Based on Monad
The monadic style of language speciication has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to reeect modiications in the source language. It has proven dif-cult to extend the method to compilation. We demonstrate that by introducing machine-like stores (code and data) into the monadic semantics and then partially evaluating the result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2014
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2014.10.017