Rewriting Higher-Order Stack Trees

02/16/2015
by   Vincent Penelle, et al.
0

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 logical properties. Indeed, the model-checking problem for monadic second order logic (respectively first order logic with a reachability predicate) is decidable on such graphs. We unify both models by introducing the notion of stack trees, trees whose nodes are labelled by higher-order stacks, and define the corresponding class of higher-order ground tree rewriting systems. We show that these graphs retain the decidability properties of ground tree rewriting graphs while generalising the pushdown hierarchy of graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2020

Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

This paper studies the logical properties of a very general class of inf...
research
05/18/2021

A Spatial Logic for a Simplicial Complex Model

Collective adaptive systems (CAS) consist of many heterogeneous componen...
research
07/17/2023

Modular Denotational Semantics for Effects with Guarded Interaction Trees

We present guarded interaction trees – a structure and a fully formalize...
research
10/21/2019

Reasoning About Recursive Tree Traversals

Traversals are commonly seen in tree data structures, and performance-en...
research
10/13/2022

A Logical Framework with Higher-Order Rational (Circular) Terms

Logical frameworks provide natural and direct ways of specifying and rea...
research
12/24/2020

Verifying Liveness Properties of ML Programs

Higher-order recursion schemes are a higher-order analogue of Boolean Pr...
research
10/27/2017

Polymorphism and the obstinate circularity of second order logic: a victims' tale

The investigations on higher-order type theories and on the related noti...

Please sign up or login with your details

Forgot password? Click here to reset