77 search results - page 7 / 16 » Algebras for Parameterised Monads |
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Every algebraic theory gives rise to a monad, and monads allow a meta-language which is a basic programming language with sideeffects. Equations in the algebraic theory give rise ...
ENTCS
2010
13 years 7 months ago
2010
Solutions of recursive program schemes over a given signature were characterized by Bruno Courcelle as precisely the context-free (or algebraic) -trees. These are the finite and ...
LISP
2006
13 years 7 months ago
2006
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
ACS
2008
13 years 7 months ago
2008
Algebras and coalgebras are fundamental notions for large parts of mathematics. The basic constructions from universal algebra are now expressed in the language of categories and ...
IWFM
2000
13 years 8 months ago
2000
Security services in a multi-user environment are often based on access control mechanisms. Static of an access control policy can be formalised using abstract algebraic models. W...