1 citations · 1 across the 7 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.FL2015
Annotated Stack Trees
Matthew Hague, Vincent Penelle
Annotated pushdown automata provide an automaton model of higher-order recursion schemes, which may in turn be used to model higher-order programs for the purposes of verification.…
cs.FL2015
Rewriting Higher-Order Stack Trees
Vincent Penelle
Higher-order pushdown systems and ground tree rewriting systems can be seen as extensions of suffix word rewriting systems. Both classes generate infinite graphs with interesting l…