131 search results - page 11 / 27 » On Monadic Theories of Monadic Predicates |
132
click to vote
LFP
1990
15 years 7 months ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
274
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
We develop a model of concurrent imperative programming with threads. We focus on a small imperative language with cooperative threads which execute without interruption until the...
155
click to vote
ENTCS
2002
15 years 5 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
205
click to vote
AOSD
2012
ACM
14 years 1 months ago
2012
ACM
Aspect-Oriented Programming (AOP) started fifteen years ago with the remark that modularization of so-called crosscutting functionalities is a fundamental problem for the enginee...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...