478 search results - page 40 / 96 » Monads of Regular Theories |
DBPL
1999
Springer
15 years 3 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
112
click to vote
POPL
1993
ACM
15 years 3 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...
AML
2008
14 years 11 months ago
2008
We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theorie...
116
click to vote
CONCUR
2008
Springer
15 years 24 days ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
131
click to vote
DIMACS
1996
15 years 10 days ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...