Sciweavers

478 search results - page 4 / 96
» Monads of Regular Theories
Sort
View
CSL
2008
Springer
13 years 11 months ago
Model Transformations in Decidability Proofs for Monadic Theories
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
Wolfgang Thomas
ENTCS
2007
132views more  ENTCS 2007»
13 years 9 months ago
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being esta...
Martin Hyland, John Power
ICFP
2005
ACM
14 years 9 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 ...
FSTTCS
2009
Springer
14 years 4 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud
JSYML
2008
105views more  JSYML 2008»
13 years 9 months ago
Finite state automata and monadic definability of singular cardinals
We define a class of finite state automata acting on transfinite sequences, and use these automata to prove that no singular cardinal can be defined by a monadic second order formu...
Itay Neeman