2014
DOI: 10.1007/978-3-642-54830-7_10
View full text
|
|
Share

Abstract: Abstract. Higher-order grammars have been extensively studied in 1980's and interests in them have revived recently in the context of higher-order model checking and program verification, where higher-order grammars are used as models of higher-order functional programs. A lot of theoretical questions remain open, however, for unsafe higher-order grammars (grammars without the so-called safety condition). In this paper, we show that any tree languages generated by order-2 unsafe grammars are context-sensitive…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
4
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals