400 search results - page 3 / 80 » Logical relations for monadic types |
STACS
2009
Springer
14 years 17 days ago
2009
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of ω-regular languages. The class has two equivalent desc...
CSL
2004
Springer
13 years 5 months ago
2004
Springer
Abstract. A new class of languages of infinite words is introduced, called the maxregular languages, extending the class of -regular languages. The class has two equivalent descrip...
LICS
1994
IEEE
13 years 10 months ago
1994
IEEE
The original semantics of Evaluation Logic in [Mog93] relies on additional properties of strong monads. This paper extends the original semantics by dropping all additional requir...
JCT
2007
13 years 5 months ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
POPL
1993
ACM
13 years 10 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...