62 search results - page 6 / 13 » Monad transformers as monoid transformers |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
JAPLL
2006
14 years 9 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
JUCS
2008
14 years 9 months ago
2008
: Functional programs often combine separate parts of the program using intermediate data structures for communicating results. Programs so defined are easier to understand and mai...
ASWEC
2005
IEEE
15 years 3 months ago
2005
IEEE
Program slicing is a well-known program analysis technique that extracts the elements of a program related to a particular computation. Based on modular monadic semantics of a pro...
FOSSACS
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Coalgebras are categorical presentations of state-based systems. In investigating parallel composition of coalgebras (realizing concurrency), we observe that the same alg...