Sciweavers

237 search results - page 9 / 48
» Modular Monad Transformers
Sort
View
BIRTHDAY
2008
Springer
13 years 9 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
DLT
2004
13 years 9 months ago
Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
Bruno Courcelle
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 7 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
HASKELL
2008
ACM
13 years 8 months ago
Lightweight monadic regions
We present Haskell libraries that statically ensure the safe use of resources such as file handles. We statically prevent accessing an already closed handle or forgetting to clos...
Oleg Kiselyov, Chung-chieh Shan
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 7 months ago
Transforming structures by set interpretations
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...
Thomas Colcombet, Christof Löding