611 search results - page 60 / 123 » Yuri, Logic, and Computer Science |
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
SOFSEM
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
RTA
2004
Springer
15 years 3 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
TLCA
1995
Springer
15 years 1 months ago
1995
Springer
We introduce a simply-typed λ-calculus (λ→ exn ) featuring an ML-like exception handling mechanism. This calculus, whose type system corresponds to classical logic through the ...
GG
2008
Springer
14 years 11 months ago
2008
Springer
Abstract Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free s...