Sciweavers

400 search results - page 2 / 80
» Logical relations for monadic types
Sort
View
CSL
2003
Springer
13 years 10 months ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
CSL
2005
Springer
13 years 11 months ago
The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order Logic
We show that the modular decomposition of a countable graph can be defined from this graph, given with an enumeration of its set of vertices, by formulas of Monadic Second-Order l...
Bruno Courcelle, Christian Delhommé
IANDC
2006
82views more  IANDC 2006»
13 years 5 months ago
Recognizability, hypergraph operations, and logical types
We study several algebras of graphs and hypergraphs and the corresponding notions of equational sets and recognizable sets. We generalize and unify several existing results which ...
Achim Blumensath, Bruno Courcelle
FOAL
2007
ACM
13 years 9 months ago
On the relation of aspects and monads
The relation between aspects and monads is a recurring topic in discussions in the programming language community, although it has never been elaborated whether their resemblences...
Christian Hofer, Klaus Ostermann
ICFP
2005
ACM
14 years 5 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...